{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"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":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXR1","name":"Runtime accessibility","shortDescription":{"text":"Runtime accessibility"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"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":"ActorStateMachine::on_event (cyclomatic 157): ActorStateMachine::on_event has cyclomatic complexity 157 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d83310d019234c09289acaeec205d571c58907114d5322587c593a8a1759ac9"}},{"ruleId":"D1","level":"warning","message":{"text":"TabletMaintainerMachine::on_event (cyclomatic 144): TabletMaintainerMachine::on_event has cyclomatic complexity 144 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b1506c440ee71f3c5c50420beaa992676f14381cc89558a95a4a38002c1778"}},{"ruleId":"D1","level":"warning","message":{"text":"MaintainerExecutor::execute (cyclomatic 107): MaintainerExecutor::execute has cyclomatic complexity 107 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e196ec7cb6f4474d5f04fab2e1b136d3dc29945dd200b99907c653faf58789"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_log::log_shard_machine::state::loaded_volume_replica::admit_mutation (cyclomatic 90): depot_log::log_shard_machine::state::loaded_volume_replica::admit_mutation has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8285cf90110282faf3914bcbbbde2c1bbb6940c7a3394ea6d21b793da2f9a2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"LogShardExecutor::open_with_payload_retention (cyclomatic 79): LogShardExecutor::open_with_payload_retention has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/executor/recovery.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d97848bfb75035f6c85eb9c320f8e05ce8b12869e5eeea421d2094ce1af0b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationIndex::apply (cyclomatic 65): OperationIndex::apply has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operations.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d96b166e9370df04d5490060fe3e893b4bd18f9baffcc0d2be9d5047cd1e947"}},{"ruleId":"D1","level":"warning","message":{"text":"native.buildNativeFactory::maybeHandleNativeInspectorRequest (cyclomatic 65): native.buildNativeFactory::maybeHandleNativeInspectorRequest has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (native.buildNativeFactory) 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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ac24d03d4fba4367f31b109297a47d68626f995ef32399d902af6b88b1edf6"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::operator_repair::activity::describe (cyclomatic 62): depot_worker::tablet_maintainer_machine::state::operator_repair::activity::describe has cyclomatic complexity 62 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"14da5dc20c498f94a7a6c6114b5440026a8fd186a2ccf6d513c363c55842de75"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowContextImpl.executeRace (cyclomatic 61): WorkflowContextImpl.executeRace has cyclomatic complexity 61 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 17 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf2ff47ae8cf294b607e71e07491a15e5b25f8c938699c31ba4d5e2aaeed869"}},{"ruleId":"D1","level":"warning","message":{"text":"SingletonCoordinator::on_event (cyclomatic 58): SingletonCoordinator::on_event has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/singleton_coordinator_machine/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fc62a7d398f553453bfd3d79f4e5070371bb953b872971aa9d1e858b175414"}},{"ruleId":"D1","level":"warning","message":{"text":"ManifestExecutor::execute (cyclomatic 57): ManifestExecutor::execute has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adc25e955944cb830d5a9d386d12b0f31db292be79920f905b7ee271220c2a9"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::differing_fields (cyclomatic 56): depot_worker::tablet_maintainer_machine::state::differing_fields has cyclomatic complexity 56 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff22bda2cc1554914012139faee4a4f6610bf1d34b8ac32f2e36aa43ae2335e"}},{"ruleId":"D1","level":"warning","message":{"text":"TopologyExecutor::execute (cyclomatic 53): TopologyExecutor::execute has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/executor.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d2e252d1c0f1d29598e9074b78074cc678e54b7e17e152a90ee5dfe8f9bf3c"}},{"ruleId":"D1","level":"warning","message":{"text":"State::request_stop (cyclomatic 52): State::request_stop has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"28722c162c4fbcf7486391f5d8b828ec6afe002fe33765535604a5ca65986b04"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::unload::drive (cyclomatic 49): depot_worker::tablet_maintainer_machine::state::unload::drive has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3631ca1b311e540cc0f08557da4feca23cd80142451f6f7737e85e0c2f3461a4"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_envoy_client::envoy::envoy_loop (cyclomatic 49): rivet_envoy_client::envoy::envoy_loop has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/envoy.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8158245ef97a9d6ecb47bc62aca029dd19b905f9a1325f9a3694a14fe07293"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_fs_core::rollback::plan (cyclomatic 47): depot_fs_core::rollback::plan has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/rollback.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a860369afc13ba71c03a5969b516ec7f83742a75ee936e63b8788ab4e51b5a74"}},{"ruleId":"D1","level":"warning","message":{"text":"VfsContext::resolve_pages (cyclomatic 47): VfsContext::resolve_pages has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"639788177df16a368ecf7d8f9605e7776cd1f2b7777f3ec03f4ba1dea7268323"}},{"ruleId":"D1","level":"warning","message":{"text":"Filesystem::admit (cyclomatic 45): Filesystem::admit 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":"engine/packages/depot-client/src/filesystem/admission.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5acba37687651159e884be9f29a9b94dd1ece504417e20c6138d1ac9ffa542f"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::execute (cyclomatic 45): Executor::execute 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":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a042a4c4a5b72650482391e7a2da168727cb200bfb9df8ce6b6979b63082fc"}},{"ruleId":"D1","level":"warning","message":{"text":"rivetkit_wasm::dispatch_event (cyclomatic 44): rivetkit_wasm::dispatch_event has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7923937f23bb0ba1819c996b0d77b9597954e69e2454e7131b75e17d12a075f"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::admit_open (cyclomatic 43): depot_worker::tablet_maintainer_machine::state::lifecycle::admit_open has cyclomatic complexity 43 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6c018f46cf989f8907a5b91bcb163ca34dbd9e4b8db4667e7a15462d6d83f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Client::command_with (cyclomatic 42): Client::command_with has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/command.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9117355b34f081ac3a9321fd5ce34d7e4d45c3aa68b6542f644fda664f8fcec1"}},{"ruleId":"D1","level":"warning","message":{"text":"TabletSupervisor::reconcile (cyclomatic 42): TabletSupervisor::reconcile has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3107eb7025c11f1e5e59d8a7b170152ba1f061e19ae3533dd41769b8ebaa92"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::loaded (cyclomatic 42): depot_worker::tablet_maintainer_machine::state::lifecycle::loaded has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49676a51552ea0da36cd5a57118a6c43f98e764586bb5f7876b698d590b3846"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryDispatcher::handle_inspector_fetch (cyclomatic 42): RegistryDispatcher::handle_inspector_fetch has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f5b1bd929e06e94568f8abd1aad3099e9f2aeb38c5ac07bd2794ff6490bb9a"}},{"ruleId":"D1","level":"warning","message":{"text":"Maintainer::start_with_alarms (cyclomatic 41): Maintainer::start_with_alarms 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"817e04e3547b8aa896f5e2d198a2d4ee3cd7f89ebfb619fca011bfccdf7dec93"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::store::drive_queue (cyclomatic 41): depot_worker::tablet_maintainer_machine::state::store::drive_queue 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edde54ff7719054d0e924946225ac4b8def4c0899eb334c10db26f64eb4dcb6"}},{"ruleId":"D1","level":"warning","message":{"text":"encoding.assertJsonCompatValue (cyclomatic 41): encoding.assertJsonCompatValue has cyclomatic complexity 41 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5964b6ff9ad07882a58e7da24dd68df390051030b470bea00f34d518092e6f"}},{"ruleId":"D1","level":"warning","message":{"text":"TabletCoordinatorMachine::on_event (cyclomatic 40): TabletCoordinatorMachine::on_event 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4365e1a3a8590baa972d452df57d0a8359175f3e6300f2fa8667ecc089ecd38c"}},{"ruleId":"D1","level":"warning","message":{"text":"Search::replacement (cyclomatic 40): Search::replacement has cyclomatic complexity 40 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cc5f1bb2adb989856ce64795a3334b6605d0a88b68d575374556bfc1bfc0e2"}},{"ruleId":"D1","level":"warning","message":{"text":"MigratorStateMachine::on_event (cyclomatic 40): MigratorStateMachine::on_event 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":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b4545b891234d6a264c1b6646c390d4610d6439122c5f398660665a595867d"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner::process_attempt (cyclomatic 40): Runner::process_attempt has cyclomatic complexity 40 (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":"engine/packages/state-machine-durable/src/runner.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b60336abffb1d09c66d1f2669619090172d7e39426be0c37e8a1d8bc97f7b7"}},{"ruleId":"D1","level":"warning","message":{"text":"OverflowMap::plan_commit (cyclomatic 39): OverflowMap::plan_commit 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":"engine/packages/sqlite-prefetch/src/overflow/commit.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edc72180e307632b825465637933afb2aa5e8f16bf86dd1a9cdee460d172364"}},{"ruleId":"D1","level":"warning","message":{"text":"TopologyStateMachine::on_event (cyclomatic 38): TopologyStateMachine::on_event has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"82309cdb0e261fb163babf47c0850068e8acc2c06042e2d0e35c4ba439c8f3ee"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_envoy_client::actor::actor_inner (cyclomatic 38): rivet_envoy_client::actor::actor_inner 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":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3209256b3db0a9e8a3960c73fd80a041177b898a2fa6815cc8ff94f142fbaf69"}},{"ruleId":"D1","level":"warning","message":{"text":"rivetkit_napi::napi_actor_events::dispatch_event (cyclomatic 38): rivetkit_napi::napi_actor_events::dispatch_event 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":"rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17a0b1ec7add144708cd57e26809a70be02308a707571a7302260cbb258c264"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::read_operation (cyclomatic 37): FilesystemStore::read_operation has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/read.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4559f4a8cff39bbc93bef47564b7a743f9639d20016ed8710f60d839596669"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::read_completed (cyclomatic 37): depot_worker::tablet_maintainer_machine::state::groups::read_completed has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc19fcb36fb6bcb2f15932cbf482fb0b5b32acac479014af257ae11add2e88e"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::alarms::attempt_completed (cyclomatic 36): depot_worker::tablet_maintainer_machine::state::alarms::attempt_completed has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"4992516f27d53be73d62002ff024841d3d7ea3bae553e91d26c8ac46a7c35bf1"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::forks::stored (cyclomatic 36): depot_worker::tablet_maintainer_machine::state::forks::stored has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6ff6b38b56de0c76d3b96c06a60bd70ff504b1dc45011d3f478a98c15e49ed"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::row (cyclomatic 35): depot_worker::tablet_maintainer_machine::state::lifecycle::row has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d75463ae64e7f48d48a7bf74d5f05412684426b7492f4c8c65587e32d9c944"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::checkpoint_change (cyclomatic 34): FilesystemStore::checkpoint_change 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":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2bdcb98b6a148353db6e67ce6ae0e2bfc9d1bd08054891421de27874d9308c"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_envoy_client::connection::native::serve_connection (cyclomatic 34): rivet_envoy_client::connection::native::serve_connection 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":"engine/sdks/rust/envoy-client/src/connection/native.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae4f5b48984954225eb9c2818f4585c35d6fc0ebc3072b0d05cd9a5e624ca9c"}},{"ruleId":"D1","level":"warning","message":{"text":"Pegboard::validate (cyclomatic 33): Pegboard::validate has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/config/pegboard.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"254fe1c1bf6942c50e5825123bb5cb28fe21e8beb2b299cee3794f069207de8f"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::runner::store_io (cyclomatic 33): depot_worker::tablet_maintainer_machine::runner::store_io has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c8d5e5b878c766fbda3fb6dc73b664da401c0ea4f79ef80e5ff3bd4f9bf48a"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::operator_repair::activity::summaries (cyclomatic 33): depot_worker::tablet_maintainer_machine::state::operator_repair::activity::summaries has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a17b2ac1da0366fbe12275baa93eedddf88518f5b9bf035e0b74d7635f791a"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::index::reconcile_active_envoy_page (cyclomatic 33): pegboard::index::reconcile_active_envoy_page has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e226c03bebd06561cb2dfbb267f01735d28984418cf12d6dfde1a43de13ecbe"}},{"ruleId":"D1","level":"warning","message":{"text":"Acquire::run (cyclomatic 33): Acquire::run has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/acquire.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f9df363326913f0e3c7c8820902e8acaba788737a4faf8cb9c57ee7ce7982d"}},{"ruleId":"D1","level":"warning","message":{"text":"LogShardMachine::on_event (cyclomatic 32): LogShardMachine::on_event has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b03a622b8cc33169570f1f504081a6325b0f4878f02bd1ce82228001b9b7c46"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_volume::volume_client_machine::requests::admit (cyclomatic 32): depot_volume::volume_client_machine::requests::admit 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":"engine/packages/depot-volume/src/volume_client_machine/requests.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb6039134512279d5bb036b9de630dbfa4ddda36937a3f2ed7ac02e595ba0a0"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::catch_up::drive (cyclomatic 32): depot_worker::tablet_maintainer_machine::state::catch_up::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"5845f47143363353d91959ccc75456a8eabdf9accf4cb6af2dbf86def121bb1c"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::runner::run_filesystem_reads (cyclomatic 31): depot_worker::tablet_maintainer_machine::runner::run_filesystem_reads 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba5919c978b4c5a704662af2dc0c79ae2558b9de25794c08c4580ef229ea40a"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::loaded (cyclomatic 31): depot_worker::tablet_maintainer_machine::state::filesystem::loaded 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"94988f21269686fd9ef0e3f9fc3f1e82eb18cbc0e071b83d68f72d73ff3e55d8"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_envoy::connection::handle_sub_stream (cyclomatic 31): pegboard_envoy::connection::handle_sub_stream 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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6ecd42cbfd62986d15f3e832e5ea33865d391e1c426a50b2acfc22dca53343"}},{"ruleId":"D1","level":"warning","message":{"text":"Prefetcher::plan (cyclomatic 31): Prefetcher::plan 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":"engine/packages/sqlite-prefetch/src/prefetcher.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66e67672e3358cfaf169620aaaaeb2f6c5ac52cdbd04c62e7ab0a212a2baaa5"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::alarms::drive (cyclomatic 30): depot_worker::tablet_maintainer_machine::state::alarms::drive has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95605d39add6d78f70e1bfa96b5c0ccee5bb81b2cbbe60ce793310fbcbaf034"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_envoy::lifecycle::deliver_within (cyclomatic 30): pegboard_envoy::lifecycle::deliver_within has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/lifecycle.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d94f511e8a93e2917785cfe805746d933c2e0ce05590ed82b29cb74c2ef895f"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowContextImpl.executeLoop (cyclomatic 30): WorkflowContextImpl.executeLoop has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f07f237986cd984914f3d8487558f028637817e6cc24fb7812187357573f20"}},{"ruleId":"D1","level":"warning","message":{"text":"View::load (cyclomatic 29): View::load 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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"301f9b93b76465ec5e6b8fb00378bb3b424decd4144a783483d463afdd5729bd"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem_reads::check (cyclomatic 29): depot_worker::tablet_maintainer_machine::state::filesystem_reads::check has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42b48d7333d18a4b606c8db3544a7773ac642d5ff61f04703f55a74b80f7b63"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::materialize::peer_job (cyclomatic 29): depot_worker::tablet_maintainer_machine::state::materialize::peer_job 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/materialize.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1f3d19cf33c4d065cd8b374d79a12df8d7e164ca47bbce9528d97dbc6e02ab"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::stop::completed (cyclomatic 29): depot_worker::tablet_maintainer_machine::state::stop::completed 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ca2b670b55f9ac6f36f1bef984acc2fa2b8ef511a2fd939ef090e327efe5d1"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::batch (cyclomatic 29): Collector::batch 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":"engine/packages/topology/src/heartbeat_gc.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecec46cc4ee6fc17a8f8e062c9f0753e61ee77fbcae96631aa26b059c736246f"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_topology::topology_machine::lease::handle_response (cyclomatic 29): rivet_topology::topology_machine::lease::handle_response has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e1b5ed383abae8da1214f41be82544cbef5d2abcb7a239a7baf042436dd18f"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryDispatcher::handle_actor_connect_websocket (cyclomatic 29): RegistryDispatcher::handle_actor_connect_websocket 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":"rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f9443baaa6d4f469ef61f6bb67a432687c1856dac5489a1e4fd722cd31872d"}},{"ruleId":"D1","level":"warning","message":{"text":"native.buildNativeFactory (cyclomatic 29): native.buildNativeFactory has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (native.buildNativeFactory::maybeHandleNativeInspectorRequest) 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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"924d752d6ce93aafa1933a3792a876912d786d959a30a0b64c2eadadf2d4bcf8"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_api_peer::volumes::serve (cyclomatic 28): rivet_api_peer::volumes::serve 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":"engine/packages/api-peer/src/volumes/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbafac889d7e2ec34ddcb3899708887b2d24f6c4274c41856674c77539cdbb77"}},{"ruleId":"D1","level":"warning","message":{"text":"DepotConfig::validate (cyclomatic 28): DepotConfig::validate 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":"engine/packages/config/src/config/depot.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"000b0068c6d689272ed5064cc9bfe2e57efe3706d716db75d617edd9890613ef"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_fs_core::apply::apply (cyclomatic 28): depot_fs_core::apply::apply 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":"engine/packages/depot-fs-core/src/apply.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce5301d7883dd7c591de09fa24bd7e5910bd07757cff38e992150e3def8a42f"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::replica_response (cyclomatic 28): depot_worker::tablet_maintainer_machine::replica_response has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: TabletMaintainerMachine::timer_name (cyclomatic 44) 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9065f231154ce39853a75fa122ee4fff96db6268fe11f87b660f45cf6498380"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::index::prepare_active_envoy_index (cyclomatic 28): pegboard::index::prepare_active_envoy_index 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":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d441bc61172063a87994f616168b627e219a289bbfc096ca1e51b59eaf34c3"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorTask::start_actor (cyclomatic 28): ActorTask::start_actor 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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a06abfb3d5491fafd5f88231b43eaa4fa022f67f0f4642304444526903a1651"}},{"ruleId":"D1","level":"warning","message":{"text":"Filesystem::refresh_inner (cyclomatic 27): Filesystem::refresh_inner has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e9b6f3ec98e37dad2859a139d24ae5f6f9eea3f3132e72e93ffbffa0985211"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_fs_core::keys::slatedb::encode_row (cyclomatic 27): depot_fs_core::keys::slatedb::encode_row has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7354befc9b574ebd0fafd02298439640641937b24b195e5f14c74183f3cc6d"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::forks::peer (cyclomatic 27): depot_worker::tablet_maintainer_machine::state::forks::peer has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6111d09a8a8143222414b6f57c9fd2c543cf74f11a6804d5dc68fbe75438f52"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_v2_migrator::migrator_machine::executor::run (cyclomatic 27): pegboard_v2_migrator::migrator_machine::executor::run has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/migrator_machine/executor.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddf045c543c565f078d22da0d9db071ae025ef734c1ce5d2d159a4d1e428d53"}},{"ruleId":"D1","level":"warning","message":{"text":"ClusterConfigStateMachine::on_event (cyclomatic 26): ClusterConfigStateMachine::on_event has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cluster-config/src/cluster_config_machine/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4ef67affb4d496832b193eeb3ff5fd41abb1242dd7cbac6e5f4a0cdd3a53ca"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::fork_references::completed (cyclomatic 26): depot_worker::tablet_maintainer_machine::state::fork_references::completed has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1971b0f284de6c0e583f1c26a59d9bbfbbd0f50bdd4cbd162e79b2d60d109e3"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::promote_caught_up (cyclomatic 26): depot_worker::tablet_maintainer_machine::state::lifecycle::promote_caught_up 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"4646025964ff7a3c1df7264ad0162185faa8aa09d6376d6a0b64933a50563583"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponseBody::poll_frame (cyclomatic 26): ResponseBody::poll_frame has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/guard-core/src/response_body.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"85553eb2c2ab74bf3aa59365bf51122b85e9c34ab75375028595549276106385"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::actor_machine::needs_allocation_at_version (cyclomatic 26): pegboard::actor_machine::needs_allocation_at_version has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb6d700fa1a931a110e01c1ebd2719f2d28784e68098d9c8a6d009291fcb8ba"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_singleton_coordinator::singleton_coordinator_machine::handle_read (cyclomatic 26): rivet_singleton_coordinator::singleton_coordinator_machine::handle_read 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":"engine/packages/singleton-coordinator/src/singleton_coordinator_machine/mod.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a20dd3c92a21205014d51adba70f9f2ea2a6abbd62bc0af307b4ab455a8621"}},{"ruleId":"D1","level":"warning","message":{"text":"OverflowMap::apply (cyclomatic 26): OverflowMap::apply 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":"engine/packages/sqlite-prefetch/src/overflow/mod.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2e3838a2b454210952af139207034ce20e9107d423a462251a3b15b3f821dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Prefetcher::fetched (cyclomatic 26): Prefetcher::fetched 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":"engine/packages/sqlite-prefetch/src/prefetcher.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc02cffa20dc9ecccb77b1170e69ea6a524b1ede94cb8ceca6ad714cab46049"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_topology::topology_machine::lease::handle_list_storage_workers_response (cyclomatic 26): rivet_topology::topology_machine::lease::handle_list_storage_workers_response 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":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ad391c28279b4ecc33e079289b880013abe927ffd7da943e109098b91c025"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorConnRaw.#handleOnClose (cyclomatic 26): ActorConnRaw.#handleOnClose 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a39736bf8195e9b6e0834a761c7547ce328743949165dd5e520dad4b8529a0"}},{"ruleId":"D1","level":"warning","message":{"text":"mod.db (cyclomatic 26): mod.db has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 115, 191, 213, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b946e539d932027abba9c531fbe5ab408f0ffed562931c27b01cb0ebe794fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"storage.flushSnapshot (cyclomatic 26): storage.flushSnapshot 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":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"35050b4d54cd53027db7fbbae0b628e5222b52304b226c3c58127037045b6098"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowContextImpl.executeStep (cyclomatic 26): WorkflowContextImpl.executeStep 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":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"8619bdcc6ef43a27fdc014bc30b1a39b4dd16ae98715acb00e0c5559ba9a3db8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.executeWorkflow (cyclomatic 26): index.executeWorkflow 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":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca926dc707b92dc711e529cf2367ddf4e38898c52deb0e95f0a3745d20f2e08"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_auth_jwt::key_ring_machine::transition (cyclomatic 25): rivet_auth_jwt::key_ring_machine::transition 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":"engine/packages/auth-jwt/src/key_ring_machine/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"486c3601359827aecaba6ad165cabf06996291562d04e580f2f4abd42da170e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Filesystem::expire_notes (cyclomatic 25): Filesystem::expire_notes 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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cedc3d1f5b75c75596c55875b883fba10a89e7e570e6450a3f3d3aff3f468d"}},{"ruleId":"D1","level":"warning","message":{"text":"VolumeHost::admit_locked (cyclomatic 25): VolumeHost::admit_locked 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":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aa93ccc8e5a4e388f615f3776f212f08cd15df01b3b7bed73cfda1339d4b0f"}},{"ruleId":"D1","level":"warning","message":{"text":"State::write_batch (cyclomatic 25): State::write_batch 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"43403f5c8815725ae9ca891fd0ff5f0210caae360a82736c999cb2b891771e8b"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_coordinator_machine::state::apply (cyclomatic 25): depot_worker::tablet_coordinator_machine::state::apply 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf101fb34e31b6b23ef7e90edc287d3ae40380a211c9cef149e89af7a7ddd56"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::activate (cyclomatic 25): depot_worker::tablet_maintainer_machine::state::deletion::activate 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a30fc731f3aebebea9db3bb5fce87346d481ece057762e1682a41240526a540"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::drive (cyclomatic 25): depot_worker::tablet_maintainer_machine::state::filesystem::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ce545dad7982e1cd61351a0ece319ce978b69d9ea3845126e0c11f80fdd7cc"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_flush (cyclomatic 25): depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_flush 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b44829cb2982d3a6898f13681216eab16bd12cce29176fd4cfd7bbdfc6dc9dc"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::advance_member (cyclomatic 25): depot_worker::tablet_maintainer_machine::state::maintainer_log::advance_member has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"51202f0bd93488f0152049b2963a09a38aadb0fba19fc04f35e2276a6db06988"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_volume::volume_client_machine::recovery::read (cyclomatic 24): depot_volume::volume_client_machine::recovery::read 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":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ae53b4690287e083dfecdebdf55602508b6e0e4f6d1d617eba16f5406ba8d3"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::select_fork_point (cyclomatic 24): FilesystemStore::select_fork_point 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":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb2ddb4b79cd2ed3fb86314ec22b18e2787b2787b3426d8153ef971f1a59b80"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::pushed (cyclomatic 24): depot_worker::tablet_maintainer_machine::state::filesystem::pushed 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"39723f8f0f54cb9866ef935088230c76790886d37dd5d090353b9c09d4e52c1a"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::legacy_backfill::legacy_move_page (cyclomatic 24): pegboard::legacy_backfill::legacy_move_page 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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c322c5ad644c474dd392556f24851876236ad033ddc5e3dbd7666c6669162664"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_gateway::routes::prepare (cyclomatic 24): pegboard_gateway::routes::prepare has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d26505fccae8ec52101abec5d8575f9eb41e56e4d84f16ed72281e6e3c62f17"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorTask::run_live (cyclomatic 24): ActorTask::run_live 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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"df94bd3c9c91e98b5c3f0f779130a5123fdb6b091770e04a735fbd5287cd0d01"}},{"ruleId":"D1","level":"warning","message":{"text":"encoding.encodeJsonCompatValue (cyclomatic 24): encoding.encodeJsonCompatValue 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":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a46da383e17cef216776c78a3f06ddcd68934be972d7b93f4b4bb3e70e21a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowContextImpl.executeJoin (cyclomatic 24): WorkflowContextImpl.executeJoin has cyclomatic complexity 24 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 12 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f66fa19020b5a69635e771eeaae625d5ec62daf3329d65d5dcbf553aa3474bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Filesystem::prepare_group (cyclomatic 23): Filesystem::prepare_group 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":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c43bd3a3ac35e96710657b8bc1952c13effd11af6c01de53d50bb4d8f8444ef"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_client::volumes::owner::run (cyclomatic 23): depot_client::volumes::owner::run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/volumes/owner.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a603733bd50a1d5709b7eb8d619d8cd8c074ae2d3950f1887d1d1374fdf3275"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_fs_core::keys::slatedb::decode_key (cyclomatic 23): depot_fs_core::keys::slatedb::decode_key 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":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"74daa95d64240890a10c87cb44cae45f22c43f22b41edf792567d61e8510c234"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_fs_core::rules::rename_with (cyclomatic 23): depot_fs_core::rules::rename_with 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":"engine/packages/depot-fs-core/src/rules.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6160a40662e550707ca79c58988e1df8773f63d96a17281fc141d044351a4eb"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_volume::volume_client_machine::recovery::begin_recovery (cyclomatic 23): depot_volume::volume_client_machine::recovery::begin_recovery 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":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"017ec5802ca9d77bea57f89fd70529491488fa00ed7e9d0bc057c37b31e460d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadSession::scan_within (cyclomatic 23): ReadSession::scan_within 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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f052765997a7aa30f24de58f48ff0976018490c203c18540c942051c40d2b223"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::fork_store_action (cyclomatic 23): FilesystemStore::fork_store_action 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":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fcfda2c81e916ec4d4153971265cfb10650b9599771c41399b1be4662d1228"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::advance (cyclomatic 23): depot_worker::tablet_maintainer_machine::state::deletion::advance 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8259d3fe81cff21f3fbc052ab928ba2c5277154685ad6783c100f51c184caf78"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::flushed (cyclomatic 23): depot_worker::tablet_maintainer_machine::state::filesystem::flushed 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d74c5217ebc6a385711f7be9db0f68e171144de634cd7181fe73098a55395f"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::fork_references::dispatch (cyclomatic 23): depot_worker::tablet_maintainer_machine::state::fork_references::dispatch 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0c4ce31d3bd626a79a4bf91d0554c4e755f12b60bc60187f9fc022eef5305"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::actor_machine::legacy_move_input (cyclomatic 23): pegboard::actor_machine::legacy_move_input 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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"7341f8ced1a97b15911035ecaff5fdace7eee1dafe47835868abdc955f11764e"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_envoy_client::actor::http::send_response (cyclomatic 23): rivet_envoy_client::actor::http::send_response 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":"engine/sdks/rust/envoy-client/src/actor/http.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"da202f7e1a88f24077e7f2657cf72cc7ffd981d7307a9c3487fa1d8b370474b4"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_envoy_client::connection::wasm::imp::single_connection (cyclomatic 23): rivet_envoy_client::connection::wasm::imp::single_connection 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":"engine/sdks/rust/envoy-client/src/connection/wasm.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2edd5d691a84586662cbf8853598718b14c0802a8e9d247bd3bc24157ba85a"}},{"ruleId":"D1","level":"warning","message":{"text":"rivetkit_core::actor::migrate_kv_to_sqlite::import_core_state_if_needed_inner (cyclomatic 23): rivetkit_core::actor::migrate_kv_to_sqlite::import_core_state_if_needed_inner 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":"rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a4e0c4453b3628d1693b2bc1d3d0e66467764e692ff5fc379cf3e7a4a1e5e2"}},{"ruleId":"D1","level":"warning","message":{"text":"lifecycle-errors.classifyActorError (cyclomatic 23): lifecycle-errors.classifyActorError has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"35060374b9f32c47e78892039d86ed940766a302931a3e6d37c1bea1c533d3ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Registry.handler (cyclomatic 23): Registry.handler has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4aae7a2142ed36a76897d7bc8ed9269a2ff9cdd0d5cf3006c2749a5a059953"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadSession::chunk_versions (cyclomatic 22): ReadSession::chunk_versions 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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"65219af3bb09afd1556c4efd248666195b87423758ec822164eb6df3e12b6378"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::remember_fork_reference_over (cyclomatic 22): FilesystemStore::remember_fork_reference_over 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":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fec762fe7dfcb81a34554ac7bd85d0924bde8c1abd34eff2cf93802d4009fcf"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::drive (cyclomatic 22): depot_worker::tablet_maintainer_machine::state::deletion::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3505e479f005a7ba869ac589123f836023c46277f0e534e640fb55d9cec54c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::operator_repair::claims::acquire_plan (cyclomatic 22): depot_worker::tablet_maintainer_machine::state::operator_repair::claims::acquire_plan 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce890116d34bd0981012c6d47e83a54f880a72e81395a6f634b4913d9e7ba79"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::store::drive_session_reads (cyclomatic 22): depot_worker::tablet_maintainer_machine::state::store::drive_session_reads 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bafaac5b6cab7af7cdc3f7477be5c28821fa20be19e6e69049bf3bb3f008a4"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::unload::forgotten (cyclomatic 22): depot_worker::tablet_maintainer_machine::state::unload::forgotten has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfda4f468a96c7e4c21e280245dac5ad31ba380becf7f33e6354964dbd2c434"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::legacy_backfill::move_actor (cyclomatic 22): pegboard::legacy_backfill::move_actor has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac19a46eb306e2ceaae1bf3c4e6c8d83dcc47464ea4445e2703da7583a8c545"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_envoy_client::tunnel::handle_tunnel_message (cyclomatic 22): rivet_envoy_client::tunnel::handle_tunnel_message 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":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e121764f493a7368f897b579f56d14b665344ff3fe8a6b5324f3b747552dd663"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::apply_dynamic (cyclomatic 21): Config::apply_dynamic 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":"engine/packages/config/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3580ddb516333fce53cb682ee3ad5e69910fc1dbbd0a25bfe8631ca45063776c"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::fork_reference_request (cyclomatic 21): FilesystemStore::fork_reference_request has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d89282de4bcfb8e741f9a177c70d2385dc0f32708fea988652285b03354bb63"}},{"ruleId":"D1","level":"warning","message":{"text":"State::read_response (cyclomatic 21): State::read_response 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7098c38e2024171d99d86d1a0dc720ae0f889d61851d4097156357fa8e15c072"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::admit (cyclomatic 21): depot_worker::tablet_maintainer_machine::state::deletion::admit has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38dd0b36b318e0de599f2b89bd2baa5f832a1b91306aa0ce37ccf0e94f536d5"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::applied (cyclomatic 21): depot_worker::tablet_maintainer_machine::state::filesystem::applied has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d607bb8f95e9f0a85c82a92ad6bfd8688c569b7bfd635c15d91eb552ba3e75"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::load (cyclomatic 21): depot_worker::tablet_maintainer_machine::state::lifecycle::load 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a2509f70a19ea7c3b19180a346c121d602f1af160f76e92074330de5ca89bb"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::operator_repair::on_event (cyclomatic 21): depot_worker::tablet_maintainer_machine::state::operator_repair::on_event has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75c40d350190f58d8014a3b9cc5e79c25be3de7df3f539e4fadc4ccf65e1053"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::execute (cyclomatic 21): Executor::execute has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/namespace_machine/executor.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"273ca59e3100bf7a17b250753c241b39ff0124ed359e1829208b20c7ad30259e"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_gateway::routes::gateway (cyclomatic 21): pegboard_gateway::routes::gateway 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":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5dc886f15c8cff129428faa75198915091f73d6ed5278532b0039dc4493e70"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanDetector::miss (cyclomatic 21): ScanDetector::miss has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/scan.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1898602ab6682b0704e47dcec76aabb1d2dce340022576c00e8fa85b3ed7db44"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_envoy_client::envoy::handle_conn_message (cyclomatic 21): rivet_envoy_client::envoy::handle_conn_message has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/envoy.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"3531d5e5f4c76274511ee70a157b2efb98f0592fb37ae561424a83bee36bea94"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorConfig::from_input (cyclomatic 21): ActorConfig::from_input has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/config.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2041ede993f59bdfe345d7e780e3fb7b949c5c8c0cf370e05f46a980fcde9f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.RegistryConfigSchema (cyclomatic 21): index.RegistryConfigSchema has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a00f2b3e89c63a5df9ec271eb2a7e5242b5ad56dda02a65c73c413e221c753"}},{"ruleId":"D1","level":"warning","message":{"text":"View::prefetch_chunks (cyclomatic 20): View::prefetch_chunks has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"718ebaf32b387694c9ab9b7553f7a289e8e60da888b8136cc921ca293354d241"}},{"ruleId":"D1","level":"warning","message":{"text":"Transaction::scan (cyclomatic 20): Transaction::scan 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":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"421315017791402a1b9662ea48dd7906e05fdee383ce63ba4f7db2fd2bfaf63c"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_fs_core::rules::resolve_within (cyclomatic 20): depot_fs_core::rules::resolve_within 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":"engine/packages/depot-fs-core/src/rules.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea3111d24ec234d7f6335ae06c6b504fcc79d813e992255966853323b23a263"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_log::log_shard_machine::state::loaded_volume_replica::admit (cyclomatic 20): depot_log::log_shard_machine::state::loaded_volume_replica::admit 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":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f695d4060a0b48a67590de300f3907c49feab9f6f9bbe6ed1f82896604aef4ac"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestExecutor::request (cyclomatic 20): RequestExecutor::request 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":"engine/packages/depot-volume/src/volume_client_machine/executor/requests.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"021cf507cd8d7edd7202a4d5ae261ac7959dfb29e05a7cd456bc2b3655b1fe2c"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_volume::volume_client_machine::lifecycle::opened (cyclomatic 20): depot_volume::volume_client_machine::lifecycle::opened 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":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0729c873c9b503fe7fc40885929f55b1f10f69a77e879f1eef62eb1d696c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_volume::volume_client_machine::pipeline::answered (cyclomatic 20): depot_volume::volume_client_machine::pipeline::answered 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":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3deb15c8832d899aa37b0ba718053d8c276580a045c337c1930cbbfa355eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::replica (cyclomatic 20): depot_worker::tablet_maintainer_machine::state::deletion::replica 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ed09695985fb881f144837eeb075435708d4a393fcef59506831c7cde44f2f"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::replica (cyclomatic 20): depot_worker::tablet_maintainer_machine::state::maintainer_log::replica 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b5f65a57ab8c79c20b57e71a6b262fc913614101282452b59ca9b64a34938a"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_engine_context::production::object_storage::build_object_store (cyclomatic 20): rivet_engine_context::production::object_storage::build_object_store 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":"engine/packages/engine-context/src/production/object_storage.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c781d574a20ad621ada5104c787d4822c9123d53e8b1f811c3d4b0903bdb7e5"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_envoy::connection::run (cyclomatic 20): pegboard_envoy::connection::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"64055828682ae98270d4956cafc4d79fad13f1fc2e63e6568bc3a889ffd3778c"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_envoy::connection::handle_ws_msg (cyclomatic 20): pegboard_envoy::connection::handle_ws_msg 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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"086bf133ab7f296609e5777950ffc78d11da3f26afd565c60dd539a55a1845e9"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_envoy::kv::execute (cyclomatic 20): pegboard_envoy::kv::execute has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/kv.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"77460b37dbb2d16a00322f58b285e29eae6fa8279da4c6caa97f313cf29ccabf"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseSlot::run_one (cyclomatic 20): DatabaseSlot::run_one 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":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8c771205107463e9ed66ed46809b0f860e6ad85d9178279642c2480e7083c0"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlite_embedded::worker::run_command_inner (cyclomatic 20): sqlite_embedded::worker::run_command_inner 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":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcd2bbc8e28b2f97a615b05b79429fb37cf92388d00a501cad97e07f4fe534c"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_topology::topology_machine::lease::timer (cyclomatic 20): rivet_topology::topology_machine::lease::timer 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":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23e97405a33f680b4f46c75a31c488ca1ec39f5e302273ded1ac26c57c5cfc6"}},{"ruleId":"D1","level":"warning","message":{"text":"rivetkit::start::handle_actor_event (cyclomatic 20): rivetkit::start::handle_actor_event 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":"rivetkit-rust/packages/rivetkit/src/start.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"983562228ee06fc6519070d97f50e2d88ae3c5c316430ab965a9b196db0086ca"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteDb::release_transaction (cyclomatic 20): SqliteDb::release_transaction 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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3de3bf9e1d3671a7a34f344bb0636736da9bd01927a1b4607f11cb5e057e58"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorConnection.handleClose (cyclomatic 20): ActorConnection.handleClose 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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"58032c5fb44e82d3dc4fe6bccbb0fcde7469d69d27a9081db4716073cbaf3eda"}},{"ruleId":"D1","level":"warning","message":{"text":"write-through-proxy.unwrapDeep (cyclomatic 20): write-through-proxy.unwrapDeep 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":"rivetkit-typescript/packages/rivetkit/src/registry/write-through-proxy.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aebb66b2dbea09a02bef5010a8d0202e9087f5bd2810e8cc84979c9c32d6bd"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_api_public_shim::routes::fork_actor_inner (cyclomatic 19): rivet_api_public_shim::routes::fork_actor_inner 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":"engine/packages/api-public-shim/src/routes.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86105eb53c2ae98f777c4d25e80f2a3864b9bdcd27f1dea037281fbc9488697"}},{"ruleId":"D1","level":"warning","message":{"text":"Slot::open_filesystem_timed (cyclomatic 19): Slot::open_filesystem_timed 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":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3283126ab3b7589c97cc2573babbfd9a68f61e6966abcd576a37a6f613c106fb"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_volume::volume_client_machine::lifecycle::claimed (cyclomatic 19): depot_volume::volume_client_machine::lifecycle::claimed 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":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0979f1eda901f05cb1f23cece11c3f108d591246fe9b08a93835c8948b879b"}},{"ruleId":"D1","level":"warning","message":{"text":"VersionFilter::filter (cyclomatic 19): VersionFilter::filter 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":"engine/packages/depot-worker/src/filesystem/filter.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c87b681261bf30f22c778812a0b353ff8326b20955e9e8bd83ec5c4246fd2f8"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::acquire_fork_reference (cyclomatic 19): FilesystemStore::acquire_fork_reference 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":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb1e608d4b6d33aac1f044cef028ef968c0038d99637d40b8f295ca5110c410"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::copy_materialized_page (cyclomatic 19): FilesystemStore::copy_materialized_page has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/materialize.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa192f810850a582239b7e3ef014a9fa95ee3e4a25115903cd394fa80b88c4e"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::sweep_locked (cyclomatic 19): FilesystemStore::sweep_locked 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":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50f72a2c8a78bba919751a6d1fdbbf67f6fe97d61eab8be358446a0a932ca68"}},{"ruleId":"D1","level":"warning","message":{"text":"State::balance (cyclomatic 19): State::balance 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/balancing.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48c529d72dae8866addf00926db99246199e4536b195d5462dd86bfe660a9ee"}},{"ruleId":"D1","level":"warning","message":{"text":"LoadedVolume::row (cyclomatic 19): LoadedVolume::row 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: depot_worker::tablet_maintainer_machine::state::store_operation_name (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3049ecc7f3ffe28758bc8467b83221df05010255b42439333f322800071f0b5a"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::services::storage::run (cyclomatic 19): depot_worker::services::storage::run has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/services/storage.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e254126e53dce7db084477233d392c36338807094e3ce03fbe65e23479e2dc"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::assignment::update (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::assignment::update 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/assignment.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6789450ba9815524c78311dd1677b9ed22bd0a5c9c4e8065160986c2902053"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::validate (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::filesystem::validate has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":3022}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f2362408e34277ca56cbf028f3716de8b7fa25cc8e0597e2597fb68436d0fd"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem_reads::completed (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::filesystem_reads::completed 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"711d22456e71b9842fa9192600a319fd3a362f30b49fac9e234d340785cb360b"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::forks::admit (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::forks::admit 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"467a48ceeb97241210f548269bfb9be22ec0a418d74091f52f298286d54a7758"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::validate (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::groups::validate has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a76f609017e070d2f02d479b4f09acea1d3cd26b4d708c1a96ce23e1c65f0d"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::complete_load (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::lifecycle::complete_load 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bf744b74d9ce65e32634e52ef4ae49ae59526caa0c1faf89473f882b1580b8"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::pending_work::scanned (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::pending_work::scanned 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/pending_work.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6df765349c96cf25708c52a2638bea1f276c4b463f82f48597720043f4557c5"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::promotion::completed (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::promotion::completed 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/promotion.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"56da8a9d17c57dcd39cfc1ecb8ec32724a8f04b5359c444046b07b772e24f141"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::retired::drive (cyclomatic 19): depot_worker::tablet_maintainer_machine::state::retired::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"221459928921623cd0fd2ccd7a75009231ffe237d243fc213cbb8c68864b8e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_engine::depot_command::tablet (cyclomatic 19): rivet_engine::depot_command::tablet 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":"engine/packages/engine/src/depot_command.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa4af5fd3173b55dc0d430a39f2fcc5db521ef6319605669269861040637919"}},{"ruleId":"D1","level":"warning","message":{"text":"epoxy::key_machine::accept (cyclomatic 19): epoxy::key_machine::accept 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":"engine/packages/epoxy/src/key_machine/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d271ca0b91a119b2ad5c1c726541381beb8996db971ebd4904fc7373bef32d06"}},{"ruleId":"D1","level":"warning","message":{"text":"sqlite_prefetch::driver::read (cyclomatic 19): sqlite_prefetch::driver::read 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":"engine/packages/sqlite-prefetch/src/driver.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ef1480f8725656ea84b9329be01bd5fd12305a1cd4b6a14f020fe65d9dfd1f"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteProfilingMetrics::from (cyclomatic 19): SqliteProfilingMetrics::from 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":"rivetkit-rust/packages/rivetkit-core/src/actor/config.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37db6ebe431b93b7083512c98dae689adc698c35652952274723143fdedb236"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorContext::teardown_sleep_state (cyclomatic 19): ActorContext::teardown_sleep_state 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":"rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"32049f6045b3433ac5df64d2a3341da981bff841ce74c994e593b2cceb3fe6c6"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorHandleRaw.#sendActionAttempts (cyclomatic 19): ActorHandleRaw.#sendActionAttempts 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ff52a34f94d96608220f2b5ac74c708da26b4e65bf58abd4fc538602baafcf"}},{"ruleId":"D1","level":"warning","message":{"text":"encoding.reviveJsonCompatValue (cyclomatic 19): encoding.reviveJsonCompatValue 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":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ffef79fc5b64c4b3c102d5d8f01239b88b3c8c5b8ca864257b8f7d25c496ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Address::parse (cyclomatic 18): Address::parse has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-peer/src/volumes/address.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7487dede4f02682c04f96b03361a0140436303febf34f279cdb5e37628d286"}},{"ruleId":"D1","level":"warning","message":{"text":"RingExecutor::execute (cyclomatic 18): RingExecutor::execute 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":"engine/packages/auth-jwt/src/key_ring_machine/executor.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb016e86ffea997e403ac169d6a85108041fa57a18423f0795ed603a2662c779"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_cli::util::build_resources (cyclomatic 18): rivet_cli::util::build_resources 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":"engine/packages/cli/src/util.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"deda9e26af0124b26dd055bc02efd357c0137a240c0588fc1ea8b693610d09f6"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_fs_core::keys::slatedb::decode_stamped_row (cyclomatic 18): depot_fs_core::keys::slatedb::decode_stamped_row 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":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c463d5007028ff7a473ad7727b3bb7de0f1dd15ab01d59df4e9478768dc4e3a"}},{"ruleId":"D1","level":"warning","message":{"text":"VolumeHandle::read_committed (cyclomatic 18): VolumeHandle::read_committed 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":"engine/packages/depot-volume/src/volume_client_machine/runner.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d85b413dff20ba7c433d03644e6cd71202dbf56a3ccba596978cfd549b15a6e"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::plan_range_whiteouts (cyclomatic 18): FilesystemStore::plan_range_whiteouts 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":"engine/packages/depot-worker/src/filesystem/apply.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"81babf4425973e74828216f40b8c1122926f300206e8104a1c63d3d521bd17cf"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::apply_maintainer_op (cyclomatic 18): FilesystemStore::apply_maintainer_op 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":"engine/packages/depot-worker/src/filesystem/maintainer_ops.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4d9131d296687389b9a47c29a391c745eb6e18b214bf8627048487a15afc58"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::catch_up::read (cyclomatic 18): depot_worker::tablet_maintainer_machine::state::catch_up::read 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7435fead43128fbeb92d960eeaf1f83606ac68089f13f9ae1b7b9d52cd0c1f"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::pins_loaded (cyclomatic 18): depot_worker::tablet_maintainer_machine::state::groups::pins_loaded 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37c9c81e627de7eb5ce735688342b17487a7137675ea1b2b2a5012a7d62d161"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::replay::drive (cyclomatic 18): depot_worker::tablet_maintainer_machine::state::maintainer_log::replay::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/replay.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d9af659fe90cd805a8c2af0221cd834283740cc2b57049d08a4d0580338a49"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::poll::drive (cyclomatic 18): depot_worker::tablet_maintainer_machine::state::poll::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4725bce90979a705a06ea5caad81ebf44334bbb8f5c258b8d04f8f57e81ddc5"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::poll::observe_reply (cyclomatic 18): depot_worker::tablet_maintainer_machine::state::poll::observe_reply has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e0fbe5b793f7ff63c8ab13d8badb8719b82405d3cafd8f2408551ea635575a"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::actor_machine::try_complete_initialization (cyclomatic 18): pegboard::actor_machine::try_complete_initialization has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Event::name (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d25d9e53a12fba0a589ae1f54781d2b235471c472fa84cb780bcb4459510e9"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::legacy_namespace_rows::legacy_walk (cyclomatic 18): pegboard::legacy_namespace_rows::legacy_walk 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":"engine/packages/pegboard/src/legacy_namespace_rows.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"68781d630719e0f5fab77e5af1484f858717937d54d395b7b8c500ac5d8636a2"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_v2_migrator::migrator_machine::on_page (cyclomatic 18): pegboard_v2_migrator::migrator_machine::on_page 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":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b33059272f357fdf591813098ea70703590919a1fc7ac8dd8e7408b2f11f147"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_service_manager::start (cyclomatic 18): rivet_service_manager::start 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":"engine/packages/service-manager/src/lib.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"604a61fcd08bcbd7736de433307b15d49bd74fa4e27467cd1ffd44303894e328"}},{"ruleId":"D1","level":"warning","message":{"text":"V3Tracker::record_and_plan (cyclomatic 18): V3Tracker::record_and_plan 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":"engine/packages/sqlite-prefetch/src/harness/readahead.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fbf06a4d4291c17ddf27a09ea254b833592e626f580ab500df3bf54887d1b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::get_pages (cyclomatic 18): Server::get_pages 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":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb9be21bf2f680d188e090514d6a908a81ca32fb9124744e0a5cc4dd1c4b06c"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineProcessManager::start_resolved (cyclomatic 18): EngineProcessManager::start_resolved 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":"rivetkit-rust/packages/engine-process/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5af8355be342dac258a2af9a1d6e9518e12a8f9281f8070903873911d8f5ac2"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorContext::apply_state_deltas_inner (cyclomatic 18): ActorContext::apply_state_deltas_inner 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":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f27dde398ea08f0f5a509cd896bcdd89b78c21e5d566d29c4b995d9002a6480"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryDispatcher::handle_inspector_websocket (cyclomatic 18): RegistryDispatcher::handle_inspector_websocket has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: rivetkit_core::registry::inspector_ws::server_message_kind (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector_ws.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f493daa976e6d3db7d7e9bf632c374dfba7046f5e6019f3277ee87c600000f7"}},{"ruleId":"D1","level":"warning","message":{"text":"CBORSupport.jsonValue (cyclomatic 18): CBORSupport.jsonValue 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":"rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdc2cf45211351935fc1f08bc9eb6ef57dd4b4ab3ad7462b3813bd74cff5c83"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorHandleRaw.#fetchWithResolvedActor (cyclomatic 18): ActorHandleRaw.#fetchWithResolvedActor 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d527e274b48d380553c1396d57727189b02e19b7a5cf031a12dc692da40daf9"}},{"ruleId":"D1","level":"warning","message":{"text":"Opts::execute (cyclomatic 17): Opts::execute 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":"engine/packages/cli/src/commands/api.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c267f356a9b98fba4f85d7d73878971e197dae5cf48a4cb2dcc04b6ce8bd84"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_log::log_shard_machine::runner::run_io (cyclomatic 17): depot_log::log_shard_machine::runner::run_io 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":"engine/packages/depot-log/src/log_shard_machine/runner.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ecc046a400de4e4d2919d661d3431bee8489e668381acc05a7c57ac79a8518"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_volume::volume_client_machine::membership::adopt (cyclomatic 17): depot_volume::volume_client_machine::membership::adopt 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":"engine/packages/depot-volume/src/volume_client_machine/membership.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5c6f2df3876d56213846be9c3dcc7d8f0c2cab757e8be9f361b9f091e0ac39"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_volume::volume_client_machine::recovery::copy (cyclomatic 17): depot_volume::volume_client_machine::recovery::copy 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":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee768877e270e33b3875da3224f0ea9343f43f72c118ff1b078f555f5761f60"}},{"ruleId":"D1","level":"warning","message":{"text":"VolumeHost::open (cyclomatic 17): VolumeHost::open 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":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fab743d10334a1052571a5b200b34592d2894f4eb18c0a7fc665941dea149b"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesystemStore::read_base_rows (cyclomatic 17): FilesystemStore::read_base_rows 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":"engine/packages/depot-worker/src/filesystem/fork_reads.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d063c456d72b9cd59b7acc51fd347562a2022163ab4a5ea87aa44f249dc52f6"}},{"ruleId":"D1","level":"warning","message":{"text":"AlarmManifestState::apply (cyclomatic 17): AlarmManifestState::apply 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/alarms.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"66762f6ae58980cbb331a7a2334bb86ca838be1222a78013bb572fe2564332ef"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::revoke_lifetime (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::revoke_lifetime has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: depot_worker::tablet_maintainer_machine::state::store_operation_name (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a4ecc9b753e1f3b7351aaa8c49d456d4b7f0bd51c4f9dca41f42d6c578e107"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::resolve_row (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::deletion::resolve_row 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"71904989f64ffb48e81cdfae8cbbeca2a7b180c479dead627b53c2d113d87df6"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_apply (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_apply 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcc38032b669152ea97def811dfbb41199d5b1b243a614785e030a749c19984"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem_reads::admit (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::filesystem_reads::admit 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"942d43db9e1ed844f501b16c51f3678ad41b7032805f2ca22cb32be6ad3a448a"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem_reads::dispatch (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::filesystem_reads::dispatch 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf11321675065bcac5ac6446db192a52c1dfc6ff21b67d0a1e0770b3b163873d"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::pin (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::groups::pin 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"2268cce47881e4a7e7ab5d99f9a33dfb8889e176d5b17c55b577e9bc84fa22c1"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::commit (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::maintainer_log::commit has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3556213f1ed94559c82ae5242ef12365462f60c043ddbef12a1a158754fd866c"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::retired::update (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::retired::update has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fc418d482ebeffea8daed763b88eab4668d8fc83fbd61a314f3b1541d2d962"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::unload::admit (cyclomatic 17): depot_worker::tablet_maintainer_machine::state::unload::admit 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf5f4bb1627d1b1d5ec42d8136567fecb4df292ed201991e1e20d2f4f33170f"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_engine::run_config::start (cyclomatic 17): rivet_engine::run_config::start 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":"engine/packages/engine/src/run_config.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a826cab5623013a5d8c4fca40934d2a8a2c56cbeddceeb014958c5a3a8931ebf"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::legacy_backfill::finish (cyclomatic 17): pegboard::legacy_backfill::finish 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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b752f827e51467e5525c70cc16a5e77c4ce2b7709565502e3fb518c5232a872c"}},{"ruleId":"D1","level":"warning","message":{"text":"OverflowMap::committed (cyclomatic 17): OverflowMap::committed has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/overflow/commit.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2037cf66fbc026b8518236b4e4f9dee26e8351c1409bcbbe135434369097158"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreRegistry::serve_with_config_and_handle_observer (cyclomatic 17): CoreRegistry::serve_with_config_and_handle_observer 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":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"93653ce0301195810f649eaadd3a4913af196a64a5119347b3a25d9bc04f6d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"CBORWire.jsonValue (cyclomatic 17): CBORWire.jsonValue 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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1ce8a7f932e442df5bb8d4d2d9918bd0ac9e033aed8f7899da671ab5c6147c"}},{"ruleId":"D1","level":"warning","message":{"text":"VirtualWebSocket.#dispatch (cyclomatic 17): VirtualWebSocket.#dispatch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/typescript/virtual-websocket/src/virtual-websocket.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d77def2c3ead167883ff672b6d46071912dbe44d6d95339ae86cb7756ee8fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"Cache::ring (cyclomatic 16): Cache::ring 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":"engine/packages/auth-jwt/src/runtime.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9995946b30190f8aef3c6b1aebecc76d472828911ce1e3ef9b527ba29de462ab"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_fs_core::overlay::merge (cyclomatic 16): depot_fs_core::overlay::merge 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":"engine/packages/depot-fs-core/src/overlay.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7ee46cd72a76245616638e67a5485fbc5916f157878c3254a588b5650e40ec"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_log::log_shard_machine::state::status_notices::dispatch (cyclomatic 16): depot_log::log_shard_machine::state::status_notices::dispatch 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":"engine/packages/depot-log/src/log_shard_machine/state/status_notices.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"24efee59e58f6c859f839ff312e7d8bce9d66b2a0e9798a6e0e99fd5b0d8b829"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::executor::repair_claims::run (cyclomatic 16): depot_worker::tablet_maintainer_machine::executor::repair_claims::run has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair_claims.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a762b0b070bf7af84d1e57f6c93ab007dc2349c3ef5de699ce07406f3595f8"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::checkpoints::admit (cyclomatic 16): depot_worker::tablet_maintainer_machine::state::checkpoints::admit 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d4408546b240a6ee4c0045b7d62c9787899ccaecf103cb188aeca83c6f5075"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::drive_pin (cyclomatic 16): depot_worker::tablet_maintainer_machine::state::deletion::drive_pin 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8e84bbbf325a5aa4eb17743dc270519eaa183a33f39df2a94083da362e8499"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::read_parent (cyclomatic 16): depot_worker::tablet_maintainer_machine::state::maintainer_log::read_parent 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e958e69765ba84d8899ff6b6bfc51e1e2ee23dcab85e9f5f29d21d3472449eb"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::store::select_resuming (cyclomatic 16): depot_worker::tablet_maintainer_machine::state::store::select_resuming 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"65548f86a9fb9a1b9895749e108a7036bb1fffe3cbd4b1033733404ec6f51455"}},{"ruleId":"D1","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::unload::idle_due (cyclomatic 16): depot_worker::tablet_maintainer_machine::state::unload::idle_due 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2313bfe1228c7852e9b392b9421c91f671a7ff8d5e0bac48bd13df8aec1a71"}},{"ruleId":"D1","level":"warning","message":{"text":"AddressClass::of_ipv4 (cyclomatic 16): AddressClass::of_ipv4 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":"engine/packages/outbound-guard/src/policy.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c68100eef7256ae3f9ecf9866bbb65e671098a2c78cde9bfbf8e41acfa269eb"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard::catalog::pool_handler (cyclomatic 16): pegboard::catalog::pool_handler 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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed155a1bd8581af0675abeb1cd9569ea53915130e2c615ad058169ff4937596"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_gateway::migrate_from_v2::proxy::pump (cyclomatic 16): pegboard_gateway::migrate_from_v2::proxy::pump 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":"engine/packages/pegboard-gateway/src/migrate_from_v2/proxy.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d3c66eda6c4f55154043e4baf6e610f1d7afd90bcc3a76237137b19375adda"}},{"ruleId":"D1","level":"warning","message":{"text":"pegboard_gateway::websocket_tunnel::proxy (cyclomatic 16): pegboard_gateway::websocket_tunnel::proxy 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":"engine/packages/pegboard-gateway/src/websocket_tunnel.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea0a4f18335437bb8b5a9993759fdb35915114ad5fe5febce3a3d5794b0bb0e"}},{"ruleId":"D1","level":"warning","message":{"text":"LeafPayloads::miss (cyclomatic 16): LeafPayloads::miss 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":"engine/packages/sqlite-prefetch/src/payloads.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede7028ad3be40e3cc800c5b59fc7fcb3c0707207d58bbfe9abfd04d5490affd"}},{"ruleId":"D1","level":"warning","message":{"text":"rivet_topology::discovery::list_storage (cyclomatic 16): rivet_topology::discovery::list_storage 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":"engine/packages/topology/src/discovery.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d235e91b6164a0fab903ca02bea88228478c96236faad20891547028544f70d0"}},{"ruleId":"D1","level":"warning","message":{"text":"ActorTask::handle_dispatch (cyclomatic 16): ActorTask::handle_dispatch 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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b73bc30f259b3e0b4a5ff7d8e9a72ca14f860d69403fa6e96490f67ae09425f"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.sendHttpRequest (cyclomatic 16): utils.sendHttpRequest has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/utils.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a4ec5cca7c14e5321b988867492f6cfc5ef9f61ca2a723907bf25cac940616"}},{"ruleId":"D1","level":"warning","message":{"text":"drizzle.db.createClient (cyclomatic 16): drizzle.db.createClient 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 5 function items inside it that branch (warnForManualTransaction, createDrizzleClient::runSql, a function literal at line 199, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eb0382b2d46d3cb3f763409c12eb986852494c7d1dc8fc014130935172c3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"otlp.anyValueFromJs (cyclomatic 16): otlp.anyValueFromJs 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":"rivetkit-typescript/packages/traces/src/otlp.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2323fc5a6b3f411d16da52c77fa3b2ae1ffb39a9a4ed6aa89c35803c5042bae"}},{"ruleId":"D2","level":"warning","message":{"text":"LogShardExecutor::open_with_payload_retention (cognitive 178): LogShardExecutor::open_with_payload_retention has cognitive complexity 178 (threshold 15). Drivers by points: if/else 41 (122 pts), match/switch 10 (27 pts), loops 9 (17 pts), boolean chains 12 (nesting depth added 106). 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":"engine/packages/depot-log/src/log_shard_machine/executor/recovery.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99ed88b377395e041ea678b817848b75dd0ac0bf95025654f405aa83fc41b98"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorStateMachine::on_event (cognitive 174): ActorStateMachine::on_event has cognitive complexity 174 (threshold 15). Drivers by points: if/else 39 (116 pts), match/switch 21 (51 pts), boolean chains 7 (nesting depth added 107). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ffa47f8adc37c48aeabe121a9e0388ed869e5cdfab854a94e46b656b96f959"}},{"ruleId":"D2","level":"warning","message":{"text":"MaintainerExecutor::execute (cognitive 147): MaintainerExecutor::execute has cognitive complexity 147 (threshold 15). Drivers by points: if/else 68 (122 pts), match/switch 7 (13 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 65). 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cf212a99a304008e3868627ea10e236ccd70d78dfd791c6c40bf7998a22b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"VfsContext::resolve_pages (cognitive 113): VfsContext::resolve_pages has cognitive complexity 113 (threshold 15). Drivers by points: if/else 41 (90 pts), loops 6 (13 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1932fed08fc82eddff7dc291e152ffa771676f1e16c8736012b856d434e4ed"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_log::log_shard_machine::state::loaded_volume_replica::admit_mutation (cognitive 109): depot_log::log_shard_machine::state::loaded_volume_replica::admit_mutation has cognitive complexity 109 (threshold 15). Drivers by points: if/else 44 (61 pts), match/switch 17 (28 pts), boolean chains 20 (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":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e618ba4c606f7d459df3940e9747802a826267b6bc9c5b925f4070cededd6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"State::request_stop (cognitive 100): State::request_stop has cognitive complexity 100 (threshold 15). Drivers by points: if/else 37 (72 pts), boolean chains 10, loops 4 (10 pts), match/switch 2 (8 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"73266848457a523476654a92981cf7a2817b144927d205a9f5b7d0945b85b793"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowContextImpl.executeRace (cognitive 93): WorkflowContextImpl.executeRace has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (65 pts), boolean chains 13, loops 6 (10 pts), error handling 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 37). Of this number, 72 points are the body\u0027s own statements and 21 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c32eb9ed0ec1bdb889a0fe0aaf78db9c33c4ef1910d845cbbfa4a016611a47"}},{"ruleId":"D2","level":"warning","message":{"text":"Maintainer::start_with_alarms (cognitive 92): Maintainer::start_with_alarms has cognitive complexity 92 (threshold 15). Drivers by points: if/else 34 (74 pts), boolean chains 7, loops 4 (6 pts), match/switch 2 (5 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf14afb6ae89c3e70d7b746f41f844e3141ffc0b4385faa145ce3788ae02a22a"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::rollback::plan (cognitive 85): depot_fs_core::rollback::plan has cognitive complexity 85 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 11 (17 pts), match/switch 9 (16 pts), boolean chains 6 (nesting depth added 42). 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":"engine/packages/depot-fs-core/src/rollback.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"86def0e8b80e6c46a8ce94fedab9150507c1a89e33951ef1fd25ea1654da4ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::unload::drive (cognitive 84): depot_worker::tablet_maintainer_machine::state::unload::drive has cognitive complexity 84 (threshold 15). Drivers by points: if/else 30 (63 pts), boolean chains 14, loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24ca7960b52eb7bfab5103cb73f2e9fb58e445cdca589635af0d724586d6803"}},{"ruleId":"D2","level":"warning","message":{"text":"ManifestExecutor::execute (cognitive 81): ManifestExecutor::execute has cognitive complexity 81 (threshold 15). Drivers by points: if/else 34 (54 pts), loops 5 (10 pts), boolean chains 9, match/switch 5 (8 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dab20d97530f6fd8b3404ecb8af62b8d30733ddf059a5b4646eb44ae5de6948"}},{"ruleId":"D2","level":"warning","message":{"text":"native.buildNativeFactory::maybeHandleNativeInspectorRequest (cognitive 80): native.buildNativeFactory::maybeHandleNativeInspectorRequest has cognitive complexity 80 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 23, ternaries 7 (13 pts), error handling 5 (9 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (native.buildNativeFactory) 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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc3cbceb607e13311316b5552425c9bc8ac15689b823b00743364d181388bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationIndex::apply (cognitive 78): OperationIndex::apply has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (63 pts), loops 5 (9 pts), match/switch 4 (6 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operations.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc50e5feef5fd0b57cf991ce52486c8eaf2db5f1194148cae22794cfaec6ad67"}},{"ruleId":"D2","level":"warning","message":{"text":"SingletonCoordinator::on_event (cognitive 76): SingletonCoordinator::on_event has cognitive complexity 76 (threshold 15). Drivers by points: if/else 34 (66 pts), boolean chains 8, match/switch 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/singleton_coordinator_machine/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fd4894c5e6bca0497d252d06342609e94ba05d312da17b0691b107d88ee652"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::index::reconcile_active_envoy_page (cognitive 71): pegboard::index::reconcile_active_envoy_page has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (54 pts), loops 5 (10 pts), boolean chains 6, match/switch 1 (nesting depth added 40). 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":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dcbf85f68496c0a723341d5d0b918c3dfb2148a9907cafbcecd757a55d9e2c"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::envoy::envoy_loop (cognitive 71): rivet_envoy_client::envoy::envoy_loop has cognitive complexity 71 (threshold 15). Drivers by points: if/else 22 (57 pts), match/switch 3 (9 pts), boolean chains 3, loops 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/envoy.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9b2ef18df75188240c40346bf07b44f17c3ba9c8450f01e899fc3025ed5979"}},{"ruleId":"D2","level":"warning","message":{"text":"OverflowMap::apply (cognitive 70): OverflowMap::apply has cognitive complexity 70 (threshold 15). Drivers by points: if/else 14 (45 pts), match/switch 6 (14 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 44). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/overflow/mod.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2beee81d659569dae48ddb412de1f671833d1742cad944c9c9a3c9d5bd255e"}},{"ruleId":"D2","level":"warning","message":{"text":"View::load (cognitive 69): View::load has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (42 pts), match/switch 5 (12 pts), loops 4 (10 pts), boolean chains 5 (nesting depth added 40). 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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbaac6895b494fb5586bc45d364f1d6e6b6681af1a39dd53d54a20216153171"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::execute (cognitive 69): Executor::execute has cognitive complexity 69 (threshold 15). Drivers by points: if/else 26 (53 pts), match/switch 8 (14 pts), boolean chains 2 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"999f02bad681d9050f04ec6a375ff56a7c896858c4eb6f0bfacedf2bd32d89c7"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::connection::native::serve_connection (cognitive 68): rivet_envoy_client::connection::native::serve_connection has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (48 pts), match/switch 7 (17 pts), loops 2, 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":"engine/sdks/rust/envoy-client/src/connection/native.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"62981ea583de074ea822b33eb4b216ee0018ccd55f540b15ad000be732371ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::actor::actor_inner (cognitive 64): rivet_envoy_client::actor::actor_inner has cognitive complexity 64 (threshold 15). Drivers by points: if/else 19 (50 pts), match/switch 4 (13 pts), loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49961eedc5f28fe13e79d8a66365cb37929062f03bcef2fc1f3f06266eac907"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadSession::chunk_versions (cognitive 63): ReadSession::chunk_versions has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 4 (10 pts), boolean chains 4 (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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02736291e798e9ffc714ba77950e849e9e67d86e6f81cc36a09feafe89f5477"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_wasm::dispatch_event (cognitive 63): rivetkit_wasm::dispatch_event has cognitive complexity 63 (threshold 15). Drivers by points: if/else 29 (55 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 28). 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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbff458aad682b2b68f3926924f69b5fa55dd38842deac707ba1310476da7bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_envoy::connection::handle_sub_stream (cognitive 62): pegboard_envoy::connection::handle_sub_stream has cognitive complexity 62 (threshold 15). Drivers by points: if/else 13 (32 pts), match/switch 8 (20 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec69000d117dc327b1382ec8141d80947a09e80d4234c2253bc389b08300d6b"}},{"ruleId":"D2","level":"warning","message":{"text":"OverflowMap::plan_commit (cognitive 62): OverflowMap::plan_commit has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 9 (12 pts), boolean chains 9, match/switch 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/overflow/commit.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"653732d296f4150bef2b5840d67f8f4cdd5fe1df0a9334cf0131fd8708059d96"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::loaded (cognitive 61): depot_worker::tablet_maintainer_machine::state::lifecycle::loaded has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 7 (15 pts), boolean chains 10 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c950fc5a4a4f49c204fb4a2ae41fa75776e95931c0be45c49d4ab2bbb1aae7d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TabletSupervisor::reconcile (cognitive 60): TabletSupervisor::reconcile has cognitive complexity 60 (threshold 15). Drivers by points: if/else 19 (35 pts), match/switch 6 (10 pts), boolean chains 8, loops 6 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"644b4424cb1319f7dbaf839b1ee15921070811e195be563e9c3df7a7acbf8387"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner::process_attempt (cognitive 57): Runner::process_attempt has cognitive complexity 57 (threshold 15). Drivers by points: loops 12 (20 pts), match/switch 9 (20 pts), if/else 8 (13 pts), boolean chains 4 (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":"engine/packages/state-machine-durable/src/runner.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af1ded504255be69c8fa164d9c88781d80a76fd877018acd2eef553234e39a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::batch (cognitive 56): Collector::batch has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 5 (18 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 33). 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":"engine/packages/topology/src/heartbeat_gc.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f382fc8b7ae233d64f3271b73b3074ebb83862ede24551e9fe289d5adb85b8"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowContextImpl.executeLoop (cognitive 56): WorkflowContextImpl.executeLoop has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (47 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"da49f7b197f26ecd4b36c16205238ae38c446ed19a7235693c05525ed9f635b1"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_api_peer::volumes::serve (cognitive 55): rivet_api_peer::volumes::serve has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (36 pts), match/switch 4 (11 pts), loops 2 (5 pts), boolean chains 3 (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":"engine/packages/api-peer/src/volumes/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b65781af7be0c5548c7f52b851e00f4cf9099dab5fc78577410a7a04962ef2d"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::differing_fields (cognitive 55): depot_worker::tablet_maintainer_machine::state::differing_fields has cognitive complexity 55 (threshold 15). Drivers by points: if/else 55. 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"19705ea275df884b8e4357b7c87f6e4b7f226361c0f0bbced490ee200f7784ef"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::store::drive_queue (cognitive 55): depot_worker::tablet_maintainer_machine::state::store::drive_queue has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 5 (12 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"307984dc767302d255e1e1338956537cfaf6a2e9761c378afda67ffa67132757"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::runner::run_filesystem_reads (cognitive 54): depot_worker::tablet_maintainer_machine::runner::run_filesystem_reads has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 9, match/switch 4 (7 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94acd34d21a9f2cf77d52bae8ef9db7ecc998796046f3b0ec6ea096bf12542e"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::row (cognitive 52): depot_worker::tablet_maintainer_machine::state::lifecycle::row has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 9, match/switch 4 (7 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc6a945e308c3d5837c2596934d3dd84936112b8cf978f632d45c234bf861a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Filesystem::admit (cognitive 51): Filesystem::admit has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 10, match/switch 7 (10 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/admission.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"080e34e00d3ca9acc5d6b9c1bf079ca3d257546fe4bd9990d23106b19be491b9"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::alarms::attempt_completed (cognitive 51): depot_worker::tablet_maintainer_machine::state::alarms::attempt_completed has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (41 pts), match/switch 4 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd171353985e7b0270a17ca3b1ad3b84e59e2a6fdb01b038a2faa05b983a8378"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::catch_up::drive (cognitive 51): depot_worker::tablet_maintainer_machine::state::catch_up::drive has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (40 pts), boolean chains 8, match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0044b0a09eb57c647b5b893481402438528dc01ed9065783a6acb37682ceb3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Prefetcher::plan (cognitive 51): Prefetcher::plan has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 12 (15 pts), match/switch 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/prefetcher.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c23dba77be89fa233fa95194816b2c146deefe5bea69dac852763d6b67850d"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::requests::admit (cognitive 50): depot_volume::volume_client_machine::requests::admit has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 10, match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/requests.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"36140d774d5f80b8a16144ba2e1e5d4cc382af2f067acddb043aeae00fcb250a"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::admit_open (cognitive 50): depot_worker::tablet_maintainer_machine::state::lifecycle::admit_open has cognitive complexity 50 (threshold 15). Drivers by points: if/else 32 (35 pts), boolean chains 14, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cacfd21e241aeac2f72552e9d629e2c9dbdd4a5f3cdd5b8544885ab43595f53"}},{"ruleId":"D2","level":"warning","message":{"text":"TopologyExecutor::execute (cognitive 50): TopologyExecutor::execute has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 10 (18 pts), loops 1 (2 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":"engine/packages/topology/src/topology_machine/executor.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8b1cfebc2b894cc06ce304a2e52aa4925d4034fc28e4c9ba0e3b3840259661"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorConnRaw.#handleOnClose (cognitive 50): ActorConnRaw.#handleOnClose has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 7, ternaries 2 (6 pts), error handling 1 (4 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b552dc39b6b8686d3e5cf1309cc6ff3d07e320f7f6008f65911d5406b395a1d7"}},{"ruleId":"D2","level":"warning","message":{"text":"TabletMaintainerMachine::on_event (cognitive 49): TabletMaintainerMachine::on_event has cognitive complexity 49 (threshold 15). Drivers by points: if/else 24 (44 pts), match/switch 2 (3 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"96977bfb1f087c04eb0af9d2a97f9b55d6324f5283a61d50896e8feac6948214"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::stop::completed (cognitive 49): depot_worker::tablet_maintainer_machine::state::stop::completed has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 11, loops 7 (11 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f78c17beda509bc146bfcbb9d2ce61bc1b22801dccd68dae3e8126e73972846"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::index::prepare_active_envoy_index (cognitive 48): pegboard::index::prepare_active_envoy_index has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 5 (11 pts), loops 3 (7 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f746d8c2d2004e07ea145032966fd57e4a55b344522273260a1ae2789a4be2"}},{"ruleId":"D2","level":"warning","message":{"text":"Acquire::run (cognitive 48): Acquire::run has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 11 (29 pts), if/else 6 (17 pts), boolean chains 1, loops 1 (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/acquire.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"768bf32a040e711f25d3604a2cff12cb1764b4b858809856b0850baf1f9585f0"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_napi::napi_actor_events::dispatch_event (cognitive 48): rivetkit_napi::napi_actor_events::dispatch_event has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (39 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 22). 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":"rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c99ad7fbe26151accb4b0ade6b82b47b66aea5d4f3be5450501dd8f7faa7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::read_operation (cognitive 47): FilesystemStore::read_operation has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 12 (19 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":"engine/packages/depot-worker/src/filesystem/read.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfb70120873e0f5a0aea30e3548d6a097f049f644178a37ff737de0e4bee390"}},{"ruleId":"D2","level":"warning","message":{"text":"TabletCoordinatorMachine::on_event (cognitive 47): TabletCoordinatorMachine::on_event has cognitive complexity 47 (threshold 15). Drivers by points: if/else 23 (44 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4629eb6fd4cde06081460eb2e8de398421ad0b8c24bb9e9fda557156b08836cd"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_envoy::lifecycle::deliver_within (cognitive 46): pegboard_envoy::lifecycle::deliver_within has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 14 (42 pts), if/else 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/lifecycle.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa38960007cfd26c8f69cfb0d12bf434a8897653430119de91500129e8ec2b"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryDispatcher::handle_actor_connect_websocket (cognitive 46): RegistryDispatcher::handle_actor_connect_websocket has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 9 (15 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9d33b09365b1abec335cd4acec70667d3d7f1257b8f5d529dcd9b11b903af8"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::select_fork_point (cognitive 44): FilesystemStore::select_fork_point has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (34 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fd38e9d9c906150079d83e76e909e424eb28deec2f73a807ed80155d854c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Prefetcher::fetched (cognitive 44): Prefetcher::fetched has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 5 (6 pts), match/switch 2 (5 pts), boolean chains 4 (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":"engine/packages/sqlite-prefetch/src/prefetcher.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6792a70bd5dff5c521c5af040dc11fae4cd8d1179ec288fac8a1227cfaf492"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::actor::http::send_response (cognitive 44): rivet_envoy_client::actor::http::send_response has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 2 (5 pts), loops 2 (3 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":"engine/sdks/rust/envoy-client/src/actor/http.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bbfa799d066ffa77878898d502cc7f4b7de5f0c4ff4f5d88960657043f7119"}},{"ruleId":"D2","level":"warning","message":{"text":"Filesystem::prepare_group (cognitive 43): Filesystem::prepare_group has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 5 (8 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b8886d0cc970a8fa9d9e4e8ff2c8cfdcd405db4afb27bee6b7feb3066d43e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::command_with (cognitive 43): Client::command_with has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 9, match/switch 4 (8 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/command.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b1c1bf48cebda70ad2286d50993716326c06116dda5d6777c2da219ab8dccd"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadSession::scan_within (cognitive 43): ReadSession::scan_within has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 5, 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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1358878786e55772117b9f8846dfd8145aaf08ceff6a27c37f9f94fa25b5002"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::checkpoint_change (cognitive 43): FilesystemStore::checkpoint_change has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 6 (11 pts), boolean chains 4 (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":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdc777fa1afda79450ef0eda7793b376db04e022dcc2aa054f9e3487a995bcc"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::alarms::drive (cognitive 43): depot_worker::tablet_maintainer_machine::state::alarms::drive has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 4 (9 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"7523db23f95a966a6367e0d7675f30dd9dd3543727dba76ac0be091f66a6c8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::forks::stored (cognitive 43): depot_worker::tablet_maintainer_machine::state::forks::stored has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 7, match/switch 3 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e049c4d9e38d5a9934f5724e0eb5d5141c285da7275ba636a71881080922660"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::read_completed (cognitive 43): depot_worker::tablet_maintainer_machine::state::groups::read_completed has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 9, match/switch 5, loops 4 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"980d20d9a2cd0a105c71ad0e6b8ca8eea51007e096a2cdf5f00dda763a120f78"}},{"ruleId":"D2","level":"warning","message":{"text":"index.executeWorkflow (cognitive 43): index.executeWorkflow has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (32 pts), error handling 3 (5 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60bc31c531e0a91f32c9334f1afaff1e88359b568b95536f32cf6b192622514"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryDispatcher::handle_inspector_fetch (cognitive 42): RegistryDispatcher::handle_inspector_fetch has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 16 (25 pts), if/else 11 (16 pts), boolean chains 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c393a7462bc6089fb0bba20b3d52f22be98ae409f252fef0974c2e88de09cf73"}},{"ruleId":"D2","level":"warning","message":{"text":"Search::replacement (cognitive 41): Search::replacement has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 25, if/else 16. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e71e21cf6837433500d45f4471468967df3124e2c69301f3c8bb69e1eafd22a"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::loaded (cognitive 40): depot_worker::tablet_maintainer_machine::state::filesystem::loaded has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94b0964acd8772c1481bb97969ba0ff0ef32e3c9f4987cf1195cead2157c54d"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::legacy_backfill::legacy_move_page (cognitive 40): pegboard::legacy_backfill::legacy_move_page has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 6 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f107b5a6ec42397051a97b24db3914248736c0b108f5952b59dc835c19abe5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"MigratorStateMachine::on_event (cognitive 40): MigratorStateMachine::on_event has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b102bfa164bc0cb0418b39bff63b7972aa8863695d53f651b18dcbc10414e02"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowContextImpl.executeStep (cognitive 40): WorkflowContextImpl.executeStep has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (28 pts), ternaries 4 (8 pts), boolean chains 3, error handling 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":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"e457e99a8e59c51138aa3e5346a1d4e138260d0c13ac16937b5846905d72f59d"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::drive (cognitive 39): depot_worker::tablet_maintainer_machine::state::deletion::drive has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 5 (8 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6e8ce383d79bb836e2e9e238b6f4690f2ada8b483b4db764cdf52c60ff7394"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_gateway::routes::gateway (cognitive 39): pegboard_gateway::routes::gateway has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 8 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4735b353d6c28882597a1791aef2d84a667ff19e083680865a1c300c4102e424"}},{"ruleId":"D2","level":"warning","message":{"text":"Filesystem::expire_notes (cognitive 38): Filesystem::expire_notes has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 4, match/switch 2 (3 pts), loops 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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d80d86b7a8d05b78d9770e85bc7bd0ab225a89eade0bd628d3cc6dba0f30a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::activate (cognitive 38): depot_worker::tablet_maintainer_machine::state::deletion::activate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 5 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f822a0015bccbfc160cc65881617400e7bae3304a6a7b27703b0911e9ed575"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_service_manager::start (cognitive 38): rivet_service_manager::start has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 5 (8 pts), match/switch 3 (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":"engine/packages/service-manager/src/lib.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda6be4cec74ac6573bb2e73c74774bcb94422d2c514d51cffd95665b142b964"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorContext::teardown_sleep_state (cognitive 38): ActorContext::teardown_sleep_state has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 6 (11 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":"rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dc0afcb090c5086e993f1be92442630ef1401266ee4b4a2b9436dc3ebe1c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"encoding.assertJsonCompatValue (cognitive 38): encoding.assertJsonCompatValue has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 14, if/else 12, loops 4 (8 pts), ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5774c92f980a6e91496df9e678122fd4665f367dfdac99085b6944e082ba4eae"}},{"ruleId":"D2","level":"warning","message":{"text":"Filesystem::refresh_inner (cognitive 37): Filesystem::refresh_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 6 (13 pts), boolean chains 8 (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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"757ba5942f01798a6dbdc21ba19a4e6fd2d0f1f103969c1801e53af39495a631"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::scan (cognitive 37): Transaction::scan has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"21197db3f5f5796416b26eabbb6805c0d45c902c16147c9bff691dd13320d5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_log::log_shard_machine::state::status_notices::dispatch (cognitive 37): depot_log::log_shard_machine::state::status_notices::dispatch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 3 (5 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":"engine/packages/depot-log/src/log_shard_machine/state/status_notices.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f735b71780f4cbdd585a1b88f48b8adb410a88354c0bffbdcd9e72509b702f"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::forks::drive (cognitive 37): depot_worker::tablet_maintainer_machine::state::forks::drive has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"314fb74672a2eae9f69673c9e32e69505ed7b803fa29129a96acd56cef12c586"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::apply_dynamic (cognitive 36): Config::apply_dynamic has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 4 (11 pts), loops 3 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3f4da571a2a309ee4c739eaa05f765c90fed5db367fa4f91664e5b770dfb51"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_flush (cognitive 36): depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_flush has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 8, match/switch 2 (5 pts), loops 4 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"afed1ca702a2a233089d41dda0cee7fdb6cc678d1bce60b1c31dd40462b7ff2b"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::store::drive_session_reads (cognitive 36): depot_worker::tablet_maintainer_machine::state::store::drive_session_reads has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb545ce607ef9443356e2ab7bfc8b5ce1235994f7a8ea3b153c6ecb0067b2c6"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::read_base_rows (cognitive 35): FilesystemStore::read_base_rows has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 2 (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":"engine/packages/depot-worker/src/filesystem/fork_reads.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0976006f718892892fe46d8c2f6b56f49ffd6aad664b1802a3f6531a810728"}},{"ruleId":"D2","level":"warning","message":{"text":"State::write_batch (cognitive 35): State::write_batch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 9, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1f36c2ee6fb40cd4d256e38fd8460be7c31c8c85eb0b99e40a0a185b6a43b6"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::flushed (cognitive 35): depot_worker::tablet_maintainer_machine::state::filesystem::flushed has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b316c7fc6e3b091115424d6b14698038b68e9607ae5f5ec61e271b3c208506"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorTask::run_live (cognitive 35): ActorTask::run_live has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 4 (11 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc895d653fbcae3ba70d7e49c34f95d78f895b50c1a63c7f6575ede384b96784"}},{"ruleId":"D2","level":"warning","message":{"text":"write-through-proxy.unwrapDeep (cognitive 35): write-through-proxy.unwrapDeep has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 6 (12 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":"rivetkit-typescript/packages/rivetkit/src/registry/write-through-proxy.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5f0ad0b5fbc71db549d5bdcab8e5bed08ceee4b9e07f3949692e4ad9a4ac94"}},{"ruleId":"D2","level":"warning","message":{"text":"index.executeLiveWorkflow (cognitive 35): index.executeLiveWorkflow has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (24 pts), error handling 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8147eab35cb6d50cfda5df88ef456023d509c741fe1c2fd727ee27e48c3bdc9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Pegboard::validate (cognitive 34): Pegboard::validate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27 (29 pts), boolean chains 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/config/pegboard.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8beb39840c1cdd05664f1ac58fb52d8e6457392aa7a4ea3e6e2e46750e7fbf7"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem_reads::check (cognitive 34): depot_worker::tablet_maintainer_machine::state::filesystem_reads::check has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 11 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30922001cddd55f8d0c9277c31509579d71e686d42900639e89d758d8ef2414"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::materialize::peer_job (cognitive 34): depot_worker::tablet_maintainer_machine::state::materialize::peer_job has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 10, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/materialize.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb4878e9a3e8238c5daf2b57cb92abaa2e64ac96a74b240938101872c1224cd"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_engine_context::production::object_storage::build_object_store (cognitive 34): rivet_engine_context::production::object_storage::build_object_store has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (9 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine-context/src/production/object_storage.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5d8ff0544a5dc1d988b5331b39c5c86d5ebea1835a70b080ab263ddb39dbd3"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_embedded::worker::run_command_inner (cognitive 34): sqlite_embedded::worker::run_command_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8591795c9d7cb1a7a563aa4282ad4f8fa34562cbc120045336bb6a2746ae9cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::actor::handle_hws_restore (cognitive 34): rivet_envoy_client::actor::handle_hws_restore has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (27 pts), match/switch 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9feebcac645b8e424a6d3c6d744fda3c114fb3c2557bb711fe0bf28929a113"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::connection::wasm::imp::single_connection (cognitive 34): rivet_envoy_client::connection::wasm::imp::single_connection has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 5 (8 pts), loops 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/connection/wasm.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f8a53e426b54e79900e43baa450ac473399f35bc722f55e8b3e8b0de448d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"storage.flushSnapshot (cognitive 34): storage.flushSnapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 8 (12 pts), boolean chains 4, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd4b2ce3f63898c23c40470ededa1636a989e68d63feb0e4d3b57cbeaf927ce"}},{"ruleId":"D2","level":"warning","message":{"text":"View::prefetch_chunks (cognitive 33): View::prefetch_chunks has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (10 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"151d2cbb2d6032ee584e7003128d1599dc4801a02f6698d1915005a539288f38"}},{"ruleId":"D2","level":"warning","message":{"text":"Filesystem::reclaim_closed (cognitive 33): Filesystem::reclaim_closed has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (8 pts), boolean chains 2, 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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f926b5838c4ce55fc971ccf10ae003c00bcf8e9d591364f85cf6bef32009f7"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_client::volumes::owner::run (cognitive 33): depot_client::volumes::owner::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 5 (6 pts), match/switch 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":"engine/packages/depot-client/src/volumes/owner.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29a8c8ea42406aba3ba4f1e9f802b14f3a146f1884c0e99667e4be1bbfb5d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorConnection.handleClose (cognitive 33): ActorConnection.handleClose has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 7, loops 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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf09c425aeae8ebcf52f7572684207e2f1293917072e3a0a3b8296d31760d28"}},{"ruleId":"D2","level":"warning","message":{"text":"VolumeHost::admit_locked (cognitive 32): VolumeHost::admit_locked has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 5 (9 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":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6611b5834b3c447e93afe3330790cebfa4b2cd8f53703233a60e1895adab496b"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::runner::store_io (cognitive 32): depot_worker::tablet_maintainer_machine::runner::store_io has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 6 (12 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7b34ca9a6abbd598d664b49297a817e59f987e1b3253955fb1c0b0eac85787"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::pushed (cognitive 32): depot_worker::tablet_maintainer_machine::state::filesystem::pushed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 7, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"102f6eedfba51e6afd6471283d359672f020694a3a73a6b5c41352e5ea9c75d0"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::promote_caught_up (cognitive 32): depot_worker::tablet_maintainer_machine::state::lifecycle::promote_caught_up has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 11, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c1f39d8245d1861a201f1436ac3e745aafa68ef5c21afc4c8645bb65bf62c4"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_runtime::build_tokio_runtime_builder (cognitive 32): rivet_runtime::build_tokio_runtime_builder has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (12 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1209f5fc2bd9b0b7345ebcce4385568acbfe1a4035aee12c1f5814764fb80c15"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_client::drivers::ws::start (cognitive 32): rivetkit_client::drivers::ws::start has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 4 (12 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/drivers/ws.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ab23151dc8e48914426be79ee16b042d42cb056c30f7017f7324b1d1e8ebf6"}},{"ruleId":"D2","level":"warning","message":{"text":"encoding.reviveJsonCompatValue (cognitive 32): encoding.reviveJsonCompatValue has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (4 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":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207f6177fbbda06bc7441764bb55a1089a261c2bb10af5e1a0557ff961dd5e6"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::rules::resolve_within (cognitive 31): depot_fs_core::rules::resolve_within has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, 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":"engine/packages/depot-fs-core/src/rules.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"306c378aa86cc65631076c2ccf5d266c5fffcc5d10a4f395e144d2773e94963d"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::checkpoints::drive (cognitive 31): depot_worker::tablet_maintainer_machine::state::checkpoints::drive has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (14 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fea1d90b04e24925d1be1f17ccb06774fef200b705e2bf549eb202928f7fba0"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_envoy::kv::execute (cognitive 31): pegboard_envoy::kv::execute has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (9 pts), match/switch 3 (7 pts) (nesting depth added 18). 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":"engine/packages/pegboard-envoy/src/kv.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f1b4469159789475529296ff35cef55b02fd06dc589b9903596b6d098e9ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::get_pages (cognitive 31): Server::get_pages has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (9 pts), match/switch 2 (3 pts), boolean chains 2 (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":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c17bec1e061f2979924ff98f5393cce5cd73cc836f590a359be2b5d20fd2819"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanDetector::miss (cognitive 31): ScanDetector::miss has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/scan.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f78ac325c56af6f3033c1d39020a357dad76b8267ad8666845ba75abd9efc4d"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_topology::topology_machine::lease::handle_list_storage_workers_response (cognitive 31): rivet_topology::topology_machine::lease::handle_list_storage_workers_response has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 6 (9 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e536bf369af020753a78df23e7266738a0d41454d94dac0cca273b717946e7"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDb::release_transaction (cognitive 31): SqliteDb::release_transaction has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"762a6c932972c8e8d69ddd430e040d27728b211d8f2bcc6a1d4492b6a35ecd20"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorHandleRaw.#sendActionAttempts (cognitive 31): ActorHandleRaw.#sendActionAttempts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 6, error handling 1 (2 pts), ternaries 1 (2 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"937fb090a18fc2834edcc7ed7d54095e40957dfaeb9423d64e4840c0efb845c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Slot::open_filesystem_timed (cognitive 30): Slot::open_filesystem_timed has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03be3854500ad2082959c15445aad8d7b41bd0e8b689a4ee286d53df0404705"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::advance_member (cognitive 30): depot_worker::tablet_maintainer_machine::state::maintainer_log::advance_member has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 8 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"df70a57899e7e8bf7dd1bae1502ed8c9fc02af7d29ad54068cdace4d61941a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::poll::drive_volume_barriers (cognitive 30): depot_worker::tablet_maintainer_machine::state::poll::drive_volume_barriers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"632dd47b6574404f285a888d21519eac29637293fe4b52b128d087707ca402f8"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_envoy::connection::run (cognitive 30): pegboard_envoy::connection::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 5 (9 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7eab0e806f3dc89876486ca1bf5e50cdedb7d241a60fe7d7c5f3c28388ef36"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_gateway::routes::prepare (cognitive 30): pegboard_gateway::routes::prepare has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 6 (9 pts), boolean chains 6, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8551e627bb435b3f251589e5a15f631cf26d47c6b35d95f5af0b20f316a08559"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorTask::start_actor (cognitive 30): ActorTask::start_actor has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 5, match/switch 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e841018d42758a64ef850972b76746a94be8584d19f062714c8ac9649b3e396e"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_log::log_shard_machine::state::reads::synced_page (cognitive 29): depot_log::log_shard_machine::state::reads::synced_page has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/reads.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"554986feaa72799b863c9e85fe67b42a08a57217081e767374fd5a459e18ba23"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::recovery::read (cognitive 29): depot_volume::volume_client_machine::recovery::read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd77922b66fdd804d2b633a408c5c3e08957c0cafcb8db8188c638c7bd345e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::drive (cognitive 29): depot_worker::tablet_maintainer_machine::state::filesystem::drive has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 6, boolean chains 5, match/switch 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4209fa0208d7b994e76dddbf996332239778b262b44e99e5a4060ee7ad9a91"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::events (cognitive 29): depot_worker::tablet_maintainer_machine::state::groups::events has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"927ca9de4def83c6b86308f8d3711d8b8945df49e28c7f6c7e82c0ef88821df5"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::poll::drive (cognitive 29): depot_worker::tablet_maintainer_machine::state::poll::drive has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (6 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"660833c5f812e1ec814a1dea4d5efdaf249af72d9b72408922f4679a157e1f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_v2_migrator::migrator_machine::on_written (cognitive 29): pegboard_v2_migrator::migrator_machine::on_written has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), match/switch 3 (5 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57060852452549e90c4ae823ccd38f5d05222c293c564274fd152f35d57923e"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_singleton_coordinator::singleton_coordinator_machine::handle_read (cognitive 29): rivet_singleton_coordinator::singleton_coordinator_machine::handle_read has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 4 (6 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/singleton_coordinator_machine/mod.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb63b368b547a3ff868ad246a876988ae1945d58be5fefc4e2b5289d20c2195"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_topology::topology_machine::lease::handle_response (cognitive 29): rivet_topology::topology_machine::lease::handle_response has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 6 (7 pts), boolean chains 6 (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":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b048700a1bb57c5ea49b058633769ac4a0b5cca38edce769505f91823259d19"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_core::actor::migrate_kv_to_sqlite::import_core_state_if_needed_inner (cognitive 29): rivetkit_core::actor::migrate_kv_to_sqlite::import_core_state_if_needed_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 8 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b32695c4e8efe14c5542f6454f702b6a7a67c05d101cec9844b4f5fe2dfc6f"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_auth_jwt::key_ring_machine::transition (cognitive 28): rivet_auth_jwt::key_ring_machine::transition has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (12 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/key_ring_machine/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"134efe3354a10b428cea1ee633d8d30998e9a65e75082d576608a5444b128383"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestExecutor::request (cognitive 28): RequestExecutor::request has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 4 (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":"engine/packages/depot-volume/src/volume_client_machine/executor/requests.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"235451c9ba3f5e1a6b7f42c1807d18a754b09a386b224b79a2294de877219218"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::plan_range_whiteouts (cognitive 28): FilesystemStore::plan_range_whiteouts has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/apply.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b823a2748305dbafa1c4de7745c8c37833a6c7f4ae3de374b53cbb86cf69c9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::copy_materialized_page (cognitive 28): FilesystemStore::copy_materialized_page has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, 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":"engine/packages/depot-worker/src/filesystem/materialize.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c50bd970d28b43c3f65922b1559000a9626707cf4b9a5c47ef34bba5db09341"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::fork_references::completed (cognitive 28): depot_worker::tablet_maintainer_machine::state::fork_references::completed has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a8fd6c578bbd9e27a51104b1db9a0aa2709c1aba84f09fdac71da86545a5c5"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::forks::admit (cognitive 28): depot_worker::tablet_maintainer_machine::state::forks::admit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 3, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"5295d6e1138b31c9351706ff35499236b811c4400abc88efb2097ec17619d265"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::load (cognitive 28): depot_worker::tablet_maintainer_machine::state::lifecycle::load has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fe3e1d963a3c0d311ae5343f0ad1d944c13e4e46b5e2c48a251e5c9969d010"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_envoy::connection::handle_ws_msg (cognitive 28): pegboard_envoy::connection::handle_ws_msg has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (7 pts), loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c064f214227d06664eec1d8393a0ad0c50a9c650912568cdce97cb11c76bcbda"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::tunnel::handle_tunnel_message (cognitive 28): rivet_envoy_client::tunnel::handle_tunnel_message has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"876d355f144558cc46e1fe5c091a8fc32ee1236fec08ef5b3ec43942ce695c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorHandleRaw.#fetchWithResolvedActor (cognitive 28): ActorHandleRaw.#fetchWithResolvedActor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5d701825026eafee4f2403a3cc2ca4687f7acc4a52911bef8d743d3af661ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorConnRaw.#sendMessage (cognitive 28): ActorConnRaw.#sendMessage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 3 (9 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 12). Of this number, 24 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f205085c278f305d2a46bc1cb74dbe7ef55dfb8526da09b3dfcb1e3e4bfe73e9"}},{"ruleId":"D2","level":"warning","message":{"text":"VirtualWebSocket.#dispatch (cognitive 28): VirtualWebSocket.#dispatch has cognitive complexity 28 (threshold 15). Drivers by points: error handling 5 (15 pts), if/else 5 (9 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/typescript/virtual-websocket/src/virtual-websocket.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"141b1dbd07691cc894ed5d97ee1d0bae0250acf29b71eec9603cc49cfc60e786"}},{"ruleId":"D2","level":"warning","message":{"text":"DepotConfig::validate (cognitive 27): DepotConfig::validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, boolean chains 9. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/config/depot.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e38fde10fde8d0e26fb406cefc9c93cb53456cb836841e8a0980f6ad78cc698"}},{"ruleId":"D2","level":"warning","message":{"text":"Root::validate_and_set_defaults (cognitive 27): Root::validate_and_set_defaults has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (8 pts), match/switch 1 (2 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":"engine/packages/config/src/config/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d79e45e9c927bad16d65876644fa11cec2c40c8854235d209a181d886d63fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"State::read_response (cognitive 27): State::read_response has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3, 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"40313c6778374599660dcc082af5cbfb28ea28f45fd0d3adc7679596b46767f2"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::advance (cognitive 27): depot_worker::tablet_maintainer_machine::state::deletion::advance has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 6, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f948ad46efe7a1db45b5b0a7fe21e5cbb04d93d9d9b1b0a397207bbd2ac07e2"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::validate (cognitive 27): depot_worker::tablet_maintainer_machine::state::filesystem::validate has cognitive complexity 27 (threshold 15). Drivers by points: loops 11 (13 pts), if/else 4 (9 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":3022}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36bdc0c3d96971dcb30a53311e7b8b823547de37544ba39a4eaa8aa63ff7f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::fork_references::dispatch (cognitive 27): depot_worker::tablet_maintainer_machine::state::fork_references::dispatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 9 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b74d759817191ac7f61d503d9965dcbc592d9922b0e3d12dcc1b35da0ec77d6"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::operator_repair::activity::summaries (cognitive 27): depot_worker::tablet_maintainer_machine::state::operator_repair::activity::summaries has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 12 (13 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd25d1914fd6c77e53dd6e7b7f47636fee24da81c83219d0c93df1a1f6ceb24"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::unload::idle_due (cognitive 27): depot_worker::tablet_maintainer_machine::state::unload::idle_due has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (4 pts), boolean chains 3, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5e6f710fc5647e21d041c1b0aff9b7ddf614609a2001c2388df9ddec9df98d"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::actor_machine::legacy_move_input (cognitive 27): pegboard::actor_machine::legacy_move_input has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 4 (7 pts), boolean chains 4 (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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9903f4ce39c3ff4a961a9f14775b71b83ba4c16fa30feaf115ff158c8529bca4"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::legacy_namespace_rows::legacy_walk (cognitive 27): pegboard::legacy_namespace_rows::legacy_walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_namespace_rows.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f1a0edf59b5e7bc1d8355e79261894ffe3ff52bb3ff2193cda42c17da4389d"}},{"ruleId":"D2","level":"warning","message":{"text":"OverflowMap::plan_purge (cognitive 27): OverflowMap::plan_purge has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 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":"engine/packages/sqlite-prefetch/src/overflow/commit.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e3948c44b1dcb84cb8d46b7cf574b72b0a6bee8f31a053ff9e9b3c3469b93b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_prefetch::driver::read (cognitive 27): sqlite_prefetch::driver::read has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (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":"engine/packages/sqlite-prefetch/src/driver.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7f4e8d12b7642e5dc1028599e93df8c28fea11958c1bd57b011b557b29651b"}},{"ruleId":"D2","level":"warning","message":{"text":"TopologyStateMachine::on_event (cognitive 27): TopologyStateMachine::on_event has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8, match/switch 3 (7 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":"engine/packages/topology/src/topology_machine/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0325c1b45e6b7d1d806a2ed466a0dd8daeeac17ac01057dee1bfecf338d30590"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorConnRaw.#handleOnMessage (cognitive 27): ActorConnRaw.#handleOnMessage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, ternaries 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85c8af8c24b531b5436099286333d84d179d9da8abd82e42c3dbb2291e0171c"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_alloc_count::sites::report (cognitive 26): rivet_alloc_count::sites::report has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 4 (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":"engine/packages/alloc-count/src/sites.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a1d60927d2ef21dcfac16f5be05f8c65cf8c460e84d4fd9601cd320ba5cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache::ring (cognitive 26): Cache::ring has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/runtime.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"68035e823bbb00c2e9fbed98a2faccbe981b26386bfe3e5147dc15cbd70c70ae"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::overlay::merge (cognitive 26): depot_fs_core::overlay::merge has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/overlay.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ce2e8de8c502ce9fe2d51dc4be03cedca898dcd6e66c8033e7d4b1a0008149"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::rules::rename_with (cognitive 26): depot_fs_core::rules::rename_with has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/rules.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c5dfd3008e932786f165442ba07c130e8b6116b46a7b32d3e2f324f243f7b2"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::replica_response (cognitive 26): depot_worker::tablet_maintainer_machine::replica_response has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e097bd99637cc51a109f43ee8bdcf44334f131760806b2c4cecc73554a6f9636"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::validate (cognitive 26): depot_worker::tablet_maintainer_machine::state::groups::validate has cognitive complexity 26 (threshold 15). Drivers by points: loops 16 (21 pts), match/switch 1 (3 pts), if/else 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"b224739386c94651f30cf1e0fb0fae69b55d46a0a6c03bd680d25f8d4195b0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::read_parent (cognitive 26): depot_worker::tablet_maintainer_machine::state::maintainer_log::read_parent has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02e7d678c08b8ab0de4bc93798bf3505378a8db398fd7b70bf8e67e950542bd"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::replay::drive (cognitive 26): depot_worker::tablet_maintainer_machine::state::maintainer_log::replay::drive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/replay.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"d511dc764cae1af9696616cf409aefe63945751dfcd8d1a76135fcbb99486b68"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::promotion::completed (cognitive 26): depot_worker::tablet_maintainer_machine::state::promotion::completed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 3, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/promotion.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1128ec93c5bb0fa0aabd28b18e8ab774efbe8bea99db62ee3eb9306bdf8fce"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_envoy::connection::read_socket (cognitive 26): pegboard_envoy::connection::read_socket has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3 (9 pts), loops 2 (5 pts) (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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"22641e0d744853829ddc00eeb5d101828079ecafe553433991f37a634d9e67b2"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_embedded_filesystem::page_protocol::stage::execute (cognitive 26): sqlite_embedded_filesystem::page_protocol::stage::execute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (5 pts), match/switch 2 (4 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded-filesystem/src/page_protocol/stage.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"404000a586b5ab72708555fb4be5deaec6e205ab1f0f7598d8a4cd25b427bd88"}},{"ruleId":"D2","level":"warning","message":{"text":"native.buildNativeFactory (cognitive 26): native.buildNativeFactory has cognitive complexity 26 (threshold 15). Drivers by points: if/else 52 (69 pts), ternaries 40 (57 pts), boolean chains 34, error handling 8 (14 pts), loops 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (native.buildNativeFactory::maybeHandleNativeInspectorRequest) 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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e9319cb4d8b732427697430e26df7ff177efc8f154a8b9fd5e546f411c3d30"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowContextImpl.executeJoin (cognitive 26): WorkflowContextImpl.executeJoin has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d43c663d12f8e94a9d760a6617830111cd6a7218d9b9f20ce57d7cc4ea0341"}},{"ruleId":"D2","level":"warning","message":{"text":"index.executeRollback (cognitive 26): index.executeRollback has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), error handling 2 (3 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":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9769a43f166e847e348a97384f177ba59c26d658180ae3d409d370ebef4a84"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::apply::apply (cognitive 25): depot_fs_core::apply::apply has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/apply.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"58589a59c4d69ce2145ac8d302862ea1329b0c81ede7f357831b9ceab2ecd6c5"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::membership::adopt (cognitive 25): depot_volume::volume_client_machine::membership::adopt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 5 (7 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":"engine/packages/depot-volume/src/volume_client_machine/membership.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb741831f539ee96d6770106303129ec3c1f6ca3690ecf8399989f9c89f749d"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::recovery::begin_recovery (cognitive 25): depot_volume::volume_client_machine::recovery::begin_recovery has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, loops 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fa47b17b7c895d47b6885b7666ee7534acfc824ede20db974a8715465ffe27"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadSession::hidden_by_own_whiteouts (cognitive 25): ReadSession::hidden_by_own_whiteouts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (7 pts), match/switch 1 (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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d2c12e0c105f85e7ed38b1e19e89c7a988a57c68cf6d984b3ea363f774d1df"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::fork_store_action (cognitive 25): FilesystemStore::fork_store_action has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32000731abc5ca6108d1541c43e790a46a958462123c10e9ad8d5c6884e0a8b"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::executor::repair_claims::run (cognitive 25): depot_worker::tablet_maintainer_machine::executor::repair_claims::run has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 5 (8 pts), loops 2 (3 pts), boolean chains 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair_claims.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37a09dc67d2f772892993e25186bdd59c855bf25d04f1ac3123c7d38791b4c9"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_apply (cognitive 25): depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_apply has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"147f8cb61574fc8374b5ea9e4f27e7a59a505ecf3bb725a11549cbd41ede228f"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::fork_references::drive (cognitive 25): depot_worker::tablet_maintainer_machine::state::fork_references::drive has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (11 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"a186a86c2d3e4a804c885424a190a3c09f244883481a52787dfd45789b11cbda"}},{"ruleId":"D2","level":"warning","message":{"text":"ActiveActorCountChanges::next (cognitive 25): ActiveActorCountChanges::next has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 3 (7 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":"rivetkit-rust/packages/rivetkit-core/src/registry/serving_envoy.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a489c9a64ef40f24c762033a04cad2a144225432f46b20d7f3275c5363270653"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.sendHttpRequest (cognitive 25): utils.sendHttpRequest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (8 pts), error handling 3 (4 pts), boolean chains 1 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/utils.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7519b10c4bba210cfa1c7d7bca73cf385438c71d45ca3dd1f45c71bef6204694"}},{"ruleId":"D2","level":"warning","message":{"text":"mod.db (cognitive 25): mod.db has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5, ternaries 3 (4 pts), error handling 2 (3 pts) (nesting depth added 3). None of this is in the body itself: all 25 points belong to 8 function literals inside it that branch (lines 191, 115, 213, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"072b792c3122b13aa844bedf6043ab410abc5381747205903bf582be5ad15c95"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_api_public_shim::routes::list_actors (cognitive 24): rivet_api_public_shim::routes::list_actors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (7 pts), loops 2 (4 pts), boolean chains 2 (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":"engine/packages/api-public-shim/src/routes.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f95dd0eeebe928ef72cb060fe7c054e5c867da2c6fb9806491b1efe0db1d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_cli::util::build_resources (cognitive 24): rivet_cli::util::build_resources has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 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":"engine/packages/cli/src/util.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5e72d77d931c2422c737f33ba339ae1c56c14b617af26399418cb0b4873376"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_log::log_shard_machine::state::memory_batches::release_replies (cognitive 24): depot_log::log_shard_machine::state::memory_batches::release_replies has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (7 pts), loops 2 (4 pts) (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":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ceddfcbcd47e958ad3d372bee36b380918937fc7ee7512ca3a3d82888270b5"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::remember_fork_reference_over (cognitive 24): FilesystemStore::remember_fork_reference_over has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, 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":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"605023a2d00e73961be33afb282198f7f0a29f02a1131ee149b589511b6c4a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::sweep_locked (cognitive 24): FilesystemStore::sweep_locked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc38ecd279297ec6c60a7646e4343946ec227e09b418a931b31f186284b1c707"}},{"ruleId":"D2","level":"warning","message":{"text":"State::prepare_grant_write (cognitive 24): State::prepare_grant_write has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/handoff.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ff2a7ab8d77ec3229aa81aaefa326506e42e73b9e1e07091de7291cab9f981"}},{"ruleId":"D2","level":"warning","message":{"text":"State::handoff_readiness (cognitive 24): State::handoff_readiness has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/handoff.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"772e3769667ed3244a03cca78bd5f34826605969baa8e12b214a3394f3d77ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::admit (cognitive 24): depot_worker::tablet_maintainer_machine::state::deletion::admit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 9 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9292340f643a45e817ac5cdea5460dc6dcb1b72ef87bc27997319ceb7c0812"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem_reads::dispatch (cognitive 24): depot_worker::tablet_maintainer_machine::state::filesystem_reads::dispatch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8600c1a5e5a7caf3e4ef15aa6a56cc358380b85992e8248b65c3455cc3503c"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::pending_work::scanned (cognitive 24): depot_worker::tablet_maintainer_machine::state::pending_work::scanned has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5, match/switch 1 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/pending_work.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"71129169c16bf4c748523c9f1bc634c7aa91f94724b3cfecd351923220dd8f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::poll::next_batch (cognitive 24): depot_worker::tablet_maintainer_machine::state::poll::next_batch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f24f55083c88d29aa8ca4a6e089904823a4492394022b70170438022b58475"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDatabase::drop (cognitive 24): NativeDatabase::drop has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8933e3c6c0dce24fe3e6904be8970c5e7bfe9cd94f2a8000790ba3014b431a5"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_client::connection::start_connection (cognitive 24): rivetkit_client::connection::start_connection has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (10 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab42ffd3a89d90082106d096f8c6205ca5a58a3ed2269e6a8da6f61e904ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::keys::slatedb::decode_key (cognitive 23): depot_fs_core::keys::slatedb::decode_key has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"954c174dc0d813bd0776445b3759fe3c4a07b74f2a3ef8eb29b4f456acc0e22b"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::recovery::copy (cognitive 23): depot_volume::volume_client_machine::recovery::copy 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":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d062036ce3edd501533aa06c079055ac74c9d2d93a33e05ecdfa47c1d1aa20"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadSession::scan_overlay (cognitive 23): ReadSession::scan_overlay has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (7 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50b4a1f8117d627ef31d89a5d90e0a7a053c5ecf290c819c369e1fbf4b59f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"AlarmManifestState::apply (cognitive 23): AlarmManifestState::apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (21 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/alarms.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef957af3afd36c7b3f6ce6a8fdee1a1fd095ebbefae23615e391e1e5f8f3d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::lifecycle::complete_load (cognitive 23): depot_worker::tablet_maintainer_machine::state::lifecycle::complete_load has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8b4c1ef891df4846ce7837caf5c5f6457f309dd9ebd7387d9d6c3ed29ee4ee"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::replica (cognitive 23): depot_worker::tablet_maintainer_machine::state::maintainer_log::replica has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f3e8878cde50aeb231c0f97fe3833899865db55de4739f0bf00f9f5ccdfdbc"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_gateway::websocket_tunnel::proxy (cognitive 23): pegboard_gateway::websocket_tunnel::proxy has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/websocket_tunnel.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc52754e035dd981da818d3ad520cac286b73e81fbdb4505a8ad94a37cea2abb"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSlot::perform (cognitive 23): DatabaseSlot::perform has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (4 pts), boolean chains 2 (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":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0870357b78b08a1a73ae0d4b8c9460057d59f3fb21acaa8685ecdc43d603b29d"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_embedded::query::exec_statements (cognitive 23): sqlite_embedded::query::exec_statements has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (sqlite_embedded::query::exec_statements_profiled) 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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b13968478e128eba23ddedbcacc7f5dc86cc0fa50135058ae98786c32eceb2"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_embedded::query::exec_statements_profiled (cognitive 23): sqlite_embedded::query::exec_statements_profiled has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (sqlite_embedded::query::exec_statements) 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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"974af42c7a107ba5821356fcd070da0d85dcc56a446bdf7f9268addc471ad8ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::pass (cognitive 23): Collector::pass has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (4 pts), match/switch 1 (3 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":"engine/packages/topology/src/heartbeat_gc.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4dd9adca797bb283ca41d68b1bd3d190e0bc1bebb5d84c75c42c489d46724d"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::actor::http::handle_req_chunk (cognitive 23): rivet_envoy_client::actor::http::handle_req_chunk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, 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":"engine/sdks/rust/envoy-client/src/actor/http.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"648b996af255eec5914dcacc2bd8c8044c45b76cb9ac426ac5317eef177535b9"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::commands::handle_commands (cognitive 23): rivet_envoy_client::commands::handle_commands has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/commands.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7411b0a31fb3b04e2c7fba96f14a33a27190213f51401b1713cf2ec2d7d18b"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorContext::apply_state_deltas_inner (cognitive 23): ActorContext::apply_state_deltas_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"831734145e26141755f1bd82ef108f530ba891608b5723bbbf946f6b8023a410"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreRegistry::serve_with_config_and_handle_observer (cognitive 23): CoreRegistry::serve_with_config_and_handle_observer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 5 (7 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":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e0672599c01bd61108612bb41cecb857fb021d73f1c207a76872d5ca7b0b43"}},{"ruleId":"D2","level":"warning","message":{"text":"logging.extractMessage (cognitive 23): logging.extractMessage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/logging.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f64699bb889a1612372ee50a643610b29dee2f49d001c511d6cccd40b329ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorHandleRaw.#sendQueueMessage (cognitive 23): ActorHandleRaw.#sendQueueMessage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 12). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 166). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a5891a9bb40e4cbc3abbb561702e9e18310b82bf62d00bdcb6d5e17e30a798"}},{"ruleId":"D2","level":"warning","message":{"text":"encoding.encodeJsonCompatValue (cognitive 23): encoding.encodeJsonCompatValue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82db6b8752d7a34f54d6625ec604c801cff3689c2cd8178de3d87783d805229"}},{"ruleId":"D2","level":"warning","message":{"text":"ClusterConfigStateMachine::on_event (cognitive 22): ClusterConfigStateMachine::on_event has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cluster-config/src/cluster_config_machine/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e22acbfb2916981a2906e3ddf6e1baa86636162bcfe174789d9a1231e3ce89"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::rules::setattr (cognitive 22): depot_fs_core::rules::setattr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 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":"engine/packages/depot-fs-core/src/rules.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6781d1048150194f7bffba987fcfcf939df05a81e447f455b69f7423ab31eedc"}},{"ruleId":"D2","level":"warning","message":{"text":"VolumeHandle::read_committed (cognitive 22): VolumeHandle::read_committed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, 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":"engine/packages/depot-volume/src/volume_client_machine/runner.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"604f4c964174eeb17e60ccda53701ecf6073dba85c044b7fb50c3ad519cb8322"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::lifecycle::opened (cognitive 22): depot_volume::volume_client_machine::lifecycle::opened has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 3 (4 pts), boolean chains 3, loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec27177effcd4a19f044ab34e7e041e6e6f7f984306c21b9ed030732b8a6b18"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::lifecycle::expired (cognitive 22): depot_volume::volume_client_machine::lifecycle::expired has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 1 (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":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8889774008abd70fe15858e29b873ffc9f4f0b8a73d4353ac1f9c29ca42deb"}},{"ruleId":"D2","level":"warning","message":{"text":"VersionFilter::filter (cognitive 22): VersionFilter::filter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/filter.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69fc3b9a07ac721c65bbe8fdddc1a198603bcbdd1da209bd89c851d750fbe02"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::fork_reference_request (cognitive 22): FilesystemStore::fork_reference_request has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 4 (6 pts), boolean chains 2 (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":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e675fa4b6ed998b0bdd87bb4a42227b89539d67b27c53b8c49c428ff8803ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"State::balance (cognitive 22): State::balance has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/balancing.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75a51e3fde1df0d9962895f9f9425f862f14951c6d69716b020248622799923"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::catch_up::completed (cognitive 22): depot_worker::tablet_maintainer_machine::state::catch_up::completed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abd9dddbdacfc92ae075f734bebda3e9abcd8ef9abc400e30b4390b9358c221"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::catch_up::read (cognitive 22): depot_worker::tablet_maintainer_machine::state::catch_up::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a18e05acb9f076d46b9ac03f5458610e3e67217fd9c827a5ba3513993a6feb"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::drain::claimed (cognitive 22): depot_worker::tablet_maintainer_machine::state::drain::claimed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/drain.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2547b42161321b20fe7940f66d349a3eadaa4902a59921bf92c498158a580518"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::opening::finish (cognitive 22): depot_worker::tablet_maintainer_machine::state::opening::finish has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/opening.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf8cf87fd70fa6447286a390985d5d25615c6b4231d227aef3289afa40a0cb5"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::operator_repair::claims::acquire_plan (cognitive 22): depot_worker::tablet_maintainer_machine::state::operator_repair::claims::acquire_plan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f599c38049028597c85c1014e638def287608f8adb6831e78dfa683dc9e51f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::poll::observe_reply (cognitive 22): depot_worker::tablet_maintainer_machine::state::poll::observe_reply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f65d7d979d2b0920ffac309012c71da1e706771e0018c4256ee3b0778d3707"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::retired::drive (cognitive 22): depot_worker::tablet_maintainer_machine::state::retired::drive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f199f3571ac6586b2de019c165acbe52a109fbbdf120944a52fb102ef27f4a25"}},{"ruleId":"D2","level":"warning","message":{"text":"epoxy::key_machine::accept (cognitive 22): epoxy::key_machine::accept has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8 (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":"engine/packages/epoxy/src/key_machine/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"32becfd7835c58187f18d10b7170454b7924a26aa042b00bce284e0eca9433a1"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::catalog::pool_handler (cognitive 22): pegboard::catalog::pool_handler has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2a82713489ca30845fb9182feaac09694d38b251c044f4200e45299582a800"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_v2_migrator::migrator_machine::on_page (cognitive 22): pegboard_v2_migrator::migrator_machine::on_page has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (8 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":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"7697588a6aaccbf72e510103ac85b3cc7204cdc8c4a62e7f8ed40fbeb2e9c304"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_singleton_coordinator::runtime::watch_worker (cognitive 22): rivet_singleton_coordinator::runtime::watch_worker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/runtime.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"934984053b92b2f0bf45a71d18b6b7a64b1cfef0aaba39264c190c38f8bb9f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"V3Tracker::record_and_plan (cognitive 22): V3Tracker::record_and_plan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/readahead.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d58a65a3bafdfe72fe2896cfd18c6c2d000e74553fc79439df340b33258430a"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_topology::topology_machine::lease::timer (cognitive 22): rivet_topology::topology_machine::lease::timer has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (10 pts), boolean chains 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e538c08b70bcdad02bb83810515f176fed9aa608b164ae2eca600b62c6eeb239"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryDispatcher::handle_inspector_websocket (cognitive 22): RegistryDispatcher::handle_inspector_websocket has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 5 (8 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":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector_ws.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbefdf50ce5f14364323f1a58a1f55981267590acf96796c7576ac6e4d8dceca"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_wasm::run_preamble (cognitive 22): rivetkit_wasm::run_preamble has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (22 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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b45fcd39388f38988aff9e6093cd5793997ac3254ef57e64a4afc18ef96cb7f"}},{"ruleId":"D2","level":"warning","message":{"text":"RowCache::install (cognitive 21): RowCache::install has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d78dae28f6ed3bf1ad969c88c97b836bd357b46398575b28f96188045b0045"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::checkpoint_page (cognitive 21): FilesystemStore::checkpoint_page has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 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":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c07f6fd78b86adfdab1366838b96a4285fdc1ff67ee935e51059e42001a929b"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::apply_maintainer_op (cognitive 21): FilesystemStore::apply_maintainer_op has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 3 (6 pts), boolean chains 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":"engine/packages/depot-worker/src/filesystem/maintainer_ops.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d365cc0739fb56f5cec502debd8a6aa1b456dddc907fbdbdca1b9311e87ae50"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::applied (cognitive 21): depot_worker::tablet_maintainer_machine::state::filesystem::applied has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb379a32ba5f8d9b68f5720bd6b8003605d9ccf72b474e1a87a11f6f56c74ad"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::pins_loaded (cognitive 21): depot_worker::tablet_maintainer_machine::state::groups::pins_loaded has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"4983ae2a4ba335b155c986d3e7f71aa70b86d723f0f5bf0fea83ee0522ef7f4f"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::repair::completed (cognitive 21): depot_worker::tablet_maintainer_machine::state::repair::completed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/repair.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c58353a68bcbf597fe6218aea1d8d6a5919742c9f5c872f5a58c3a763916a7"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::retired::update (cognitive 21): depot_worker::tablet_maintainer_machine::state::retired::update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), match/switch 2 (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac43e87d4367883ab3c3fc974559ffcf6494bd1e0aafa7ade3ee18fa384d62a"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::startup::completed (cognitive 21): depot_worker::tablet_maintainer_machine::state::startup::completed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/startup.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3f9620bfa14f4a9c3f87bc11f2eb50e14c548f5241e537c5597fabf10c3931"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::store::select_resuming (cognitive 21): depot_worker::tablet_maintainer_machine::state::store::select_resuming has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aa8c04f832b9b089950fffcf716f08fd6828bb383f4f146a55a73871847fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_engine::run_config::start (cognitive 21): rivet_engine::run_config::start has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (17 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":"engine/packages/engine/src/run_config.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5977bdc677a8318b062cfd79ef86c4be97683ff014ee54314dd2d5fab9a85d"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::legacy_backfill::claim_database (cognitive 21): pegboard::legacy_backfill::claim_database has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1be92cd960622298ca6c34be20cd37c5e2ac89467f1f65d7c11a680e6b69369"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::legacy_backfill::wait_ready (cognitive 21): pegboard::legacy_backfill::wait_ready has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (4 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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4e145eabdc3741d9d31e6fba9bed6f1e2655ba22b01d6b4af355d2eccd24e4"}},{"ruleId":"D2","level":"warning","message":{"text":"WaitGuard::notified (cognitive 21): WaitGuard::notified has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 2 (6 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/start_waits.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a768100eff4f087e0de3ac5d6636c01c022cdce209b4845df2052e59ebcd8430"}},{"ruleId":"D2","level":"warning","message":{"text":"PoolShared::next_task (cognitive 21): PoolShared::next_task has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (4 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":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"495b932ba4e9b9ef1d1b9f7152f16d0d3b34c5427decb3539323aad47349b7f6"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyPrefixScan::next_page (cognitive 21): LegacyPrefixScan::next_page has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"097c25070201fef7f5921ee29b0eecd667a2f7e7717076da1fe6dae1aab9233a"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorTask::handle_dispatch (cognitive 21): ActorTask::handle_dispatch has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 3 (4 pts), boolean chains 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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca44615edd653cc51b43762b8b181780ff7836ccd4c374e20253c217a9828aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_core::actor::internal_storage::clear_table_bounded (cognitive 21): rivetkit_core::actor::internal_storage::clear_table_bounded has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5415e33f78d9f26b01ce8d3dd55204f5b4f112f95b07765c94a9d95805d308a0"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatcher.drainDispatchQueue (cognitive 21): dispatcher.drainDispatchQueue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 2 (7 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/dispatcher.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca1db72ac1df45ef02a245a8f7445e5510feca1287042a102de93d98ad62464"}},{"ruleId":"D2","level":"warning","message":{"text":"native-http.buildNativeHttpRequest (cognitive 21): native-http.buildNativeHttpRequest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 4 (7 pts), boolean chains 4, error handling 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":"rivetkit-typescript/packages/rivetkit/src/registry/native-http.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac64f83a4e18235fedfa5968bd8e3299fb58172e701972e388b18e924808e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"RingExecutor::execute (cognitive 20): RingExecutor::execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 5 (9 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":"engine/packages/auth-jwt/src/key_ring_machine/executor.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"573960925e541b6c11fae53368bf11c0ad7ba869acb35489cb7edbf4f9efb778"}},{"ruleId":"D2","level":"warning","message":{"text":"Postimages::scan (cognitive 20): Postimages::scan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 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":"engine/packages/depot-client/src/filesystem/file_batch.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85abc43f37270ea013cdbd492403158e2fc5f47b3859032e509172c9a9e04ea"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::rules::write (cognitive 20): depot_fs_core::rules::write has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 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":"engine/packages/depot-fs-core/src/rules.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc7ce03fbbdc0b9d594b550df7e9a05a726272098959510d955c002c5a6eaf5"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadSession::resolve_chunks (cognitive 20): ReadSession::resolve_chunks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/base.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ad1b875b25b17d8f75089827ce645434cf802067f38a1a0259a92a5fe6bcd2"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::acquire_fork_reference (cognitive 20): FilesystemStore::acquire_fork_reference has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 2, boolean chains 1, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f4727130a0627f1440d8b312c81da62e90b082e4fbb4f4a6e1d32ea61701b2"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::revoke_lifetime (cognitive 20): depot_worker::tablet_maintainer_machine::state::revoke_lifetime has cognitive complexity 20 (threshold 15). Drivers by points: loops 13 (14 pts), if/else 3 (6 pts) (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9dec3242007ed7b00c80f4f97f94c4346d5c8c0b4caeeaad89c35941257b20"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::assignment::update (cognitive 20): depot_worker::tablet_maintainer_machine::state::assignment::update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/assignment.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a4a1784e06c16c31ccf1fad91977b2b34f8217e86b7210fe69f944170ef374"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::recreate (cognitive 20): depot_worker::tablet_maintainer_machine::state::deletion::recreate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6caea4935c06e5f284b11500e74b1f8a9c9cf9b9a588261281e5d038ffb04cd"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem::mark_record_missing (cognitive 20): depot_worker::tablet_maintainer_machine::state::filesystem::mark_record_missing has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9611cb8f7cf615b0bb104680e59bef05e5cb45ae7df29a2f741cd167a007dab"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem_reads::completed (cognitive 20): depot_worker::tablet_maintainer_machine::state::filesystem_reads::completed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9d3ced28447ac59d8a0b33d06b52edf81df2e66f7d8aee1f188254b4f71e66"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::commit (cognitive 20): depot_worker::tablet_maintainer_machine::state::maintainer_log::commit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 pts), boolean chains 3, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c392a0a23a1db2a37b3cc3cd6914e83247edb07ed58513d5a541bf41bd5382"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::stop::cold_reload_source (cognitive 20): depot_worker::tablet_maintainer_machine::state::stop::cold_reload_source has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e016f93985861feadb0981c8a1fe9bb0311d3af4be6bb1a2eb8701778b7491f"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::unload::forgotten (cognitive 20): depot_worker::tablet_maintainer_machine::state::unload::forgotten has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a67ea25a011a18a534aafe6a93cf1e1dfe85bbab73265c0c41c7825dd74056"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_engine::depot_command::health::sample (cognitive 20): rivet_engine::depot_command::health::sample has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (12 pts), match/switch 3 (5 pts), if/else 2 (3 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":"engine/packages/engine/src/depot_command/health.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a87fddf25c230f7117a623fc2e17e442ea4324cdd9665466397af5c42dd286"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::expand_overflow (cognitive 20): Server::expand_overflow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e5fa89894d86c1ac63045cac0f080f746c861ae8ef08d2036134ed595ceb97"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineProcessManager::start_resolved (cognitive 20): EngineProcessManager::start_resolved has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/engine-process/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7917d0406db5e80cabdb1d08601d57e50dcdfe7da69fe58fe774558baa05132e"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorConfig::from_input (cognitive 20): ActorConfig::from_input has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. 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":"rivetkit-rust/packages/rivetkit-core/src/actor/config.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"861037f411ea82660602f7a348c25d33a4b381c79712afa404acb3d38ad21fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorContext::prepare_state_deltas (cognitive 20): ActorContext::prepare_state_deltas has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 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":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aede9245b210fe6de5360a62cf24843ca5788314cfcc6f4146e789c214a076"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorContext::take_due_schedule_dispatches (cognitive 20): ActorContext::take_due_schedule_dispatches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"be70be4934401c3a83193376f398780d6123fc264ad02300effa563af38190bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDb::finish_transaction_inner (cognitive 20): SqliteDb::finish_transaction_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"134c431e4f270c3b1901103a4a4c457455c5af1e773c7d76ab2b349e2e80ec81"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_wasm::start_wasm_serverless_request (cognitive 20): rivetkit_wasm::start_wasm_serverless_request has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 5 (8 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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca50313bcf91cd0d93b704b0077a2cd650fc31145952e96f03f6d0dc41e6f10"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorObservable.attachConnectionHandlers (cognitive 20): ActorObservable.attachConnectionHandlers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7d3d3ce2382c3028de7c29942c7b55984d49293bb8e7b56a022bd48568d8d8"}},{"ruleId":"D2","level":"warning","message":{"text":"RivetAgentCoordinator.reconcileSubmissions (cognitive 20): RivetAgentCoordinator.reconcileSubmissions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (4 pts), loops 4, 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":"integrations/flue-runtime/src/agent-coordinator.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"231faec1d0081e81da35ffb07674c69d7e76db96bb548975db32509993b659e8"}},{"ruleId":"D2","level":"warning","message":{"text":"keys.deserializeActorKey (cognitive 20): keys.deserializeActorKey has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"046389bc9e6d57edb13e9eaf8c4ed1e35fc1f80d806be549b93ede97c6ae6520"}},{"ruleId":"D2","level":"warning","message":{"text":"otlp.anyValueFromJs (cognitive 20): otlp.anyValueFromJs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/otlp.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5967c50a480c61450199c74b6597dd69cd3d8e5dbb2625d6bc8a204a3841917d"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_api_public_shim::routes::fork_actor_inner (cognitive 19): rivet_api_public_shim::routes::fork_actor_inner has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 6 (7 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public-shim/src/routes.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"357c4da492e357894cfa17e81c761bf0f841822c4e5a2083e3ff54f4b1ec8831"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_auth_jwt::rotation::serve (cognitive 19): rivet_auth_jwt::rotation::serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/rotation.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7954e92e3e095c1f88432eb07e5163606f123283486a4f12780b68656beda3d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Opts::deploy_project (cognitive 19): Opts::deploy_project 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":"engine/packages/cli/src/commands/deploy.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc8c84a0314210d8d4f898b176ea9986bce57dbe83cfbfe65b1b126593a64ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Filesystem::replay (cognitive 19): Filesystem::replay has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/replay.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ab435968185a4ce7cbc899a467a52d8f337901ace4195bc1722a4b81e3a871"}},{"ruleId":"D2","level":"warning","message":{"text":"Slot::checkpoint (cognitive 19): Slot::checkpoint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), 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":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9457008ab3a897845078b8402f6da16701a67bd7ddeab93a43bbd55bf341408"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::keys::slatedb::decode_stamped_row (cognitive 19): depot_fs_core::keys::slatedb::decode_stamped_row has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 10 (19 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e73f4929b5b34b9c2dcc8250eeec2bed531c9fb035d6602518a7d1c2508c01"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadedVolumeReplica::append_entries (cognitive 19): LoadedVolumeReplica::append_entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"7285688f5fa0bff76118119dccb12e1771dd2e7a380a2a17266b17ff4915433d"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_log::log_shard_machine::state::memory_batches::dispatch (cognitive 19): depot_log::log_shard_machine::state::memory_batches::dispatch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (5 pts), boolean chains 3, 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":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff49d51d3687b28c0ba460b5cfd6b2f0aaca7bbf5665c3e79f24853db3e4ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_log::log_shard_machine::state::memory_batches::written_to_disk (cognitive 19): depot_log::log_shard_machine::state::memory_batches::written_to_disk has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (14 pts), loops 1 (4 pts), if/else 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e055688ec085872fa0de7d1e01343bf7315acd8b32d558698ac1ebc2228cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::pipeline::send_to (cognitive 19): depot_volume::volume_client_machine::pipeline::send_to has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1933412c3a73b075d2006fac060557fe7f2f2445a1b8ad1ec4f9ddf584448c7"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::pipeline::fence_with_error (cognitive 19): depot_volume::volume_client_machine::pipeline::fence_with_error has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"181ba0a809353a898d502e54d581662f4cea246aedf4075ca061df9d46259b10"}},{"ruleId":"D2","level":"warning","message":{"text":"GroupRecordCache::apply (cognitive 19): GroupRecordCache::apply has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 3 (7 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into 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":"engine/packages/depot-worker/src/group_events/records.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b19710e3e6c1c9a4e9c7804f7861414f64bd07e0c7c57414b3374a058e6f20e"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::group_events::poll::poll_once (cognitive 19): depot_worker::group_events::poll::poll_once has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 3, 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":"engine/packages/depot-worker/src/group_events/poll.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2ef65f1a62621420f51300425c94af59c3077366cc414011310e88c6983db6"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::services::storage::run (cognitive 19): depot_worker::services::storage::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3, loops 2, boolean chains 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":"engine/packages/depot-worker/src/services/storage.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5801cf3ba2ee71d97735066d58b1adc957889ffd5e75d43b573006e3b35134dc"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_coordinator_machine::placement::choose_members (cognitive 19): depot_worker::tablet_coordinator_machine::placement::choose_members has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb90a1d3b4afffd59389288c67f45d4e4e8a567dfd0cecc21835e71731d567b"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::checkpoints::admit (cognitive 19): depot_worker::tablet_maintainer_machine::state::checkpoints::admit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c494345a491501959a176b4293fabb7e1aa6e19f905dc889dc5c2d1fc3162d"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::resolve_row (cognitive 19): depot_worker::tablet_maintainer_machine::state::deletion::resolve_row has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77143e63365cb61ab8e67ca7918f20d73680fed1661f75502fe5beeede89df8"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::filesystem_reads::admit (cognitive 19): depot_worker::tablet_maintainer_machine::state::filesystem_reads::admit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"20044d4006153e64bd0f324307f38d4507cffef8fa545a7a9a4db9bb6967b9ca"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::groups::pin (cognitive 19): depot_worker::tablet_maintainer_machine::state::groups::pin has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfda07e678d82376edbbb432f8667359ab6612398b95672ce4c0b53608a431a2"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::operator_repair::on_event (cognitive 19): depot_worker::tablet_maintainer_machine::state::operator_repair::on_event has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (7 pts) (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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1319a75254f1910b58f3709b1fa8d4b15c2a583b65fc51dacca73fa481930a"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::operator_repair::activity::page (cognitive 19): depot_worker::tablet_maintainer_machine::state::operator_repair::activity::page has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa99f40565196830fd91a4996c9c5514c129f9847645d6146e64434766751f26"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::unload::admit (cognitive 19): depot_worker::tablet_maintainer_machine::state::unload::admit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de939cb9e04d0637403c87e9f89dfb907771d55375d4e8ce3ba90984cfc400d"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_engine::depot_command::migrate_from_v2::migrate (cognitive 19): rivet_engine::depot_command::migrate_from_v2::migrate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (7 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":"engine/packages/engine/src/depot_command/migrate_from_v2.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e2ccb256e7ead53ac680e95fdb6b7a4f9af06893b4b050c519e618da5571af"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::actor_machine::try_complete_initialization (cognitive 19): pegboard::actor_machine::try_complete_initialization has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0298065daf7537056ffa7f497f0d111c6bc1dff43123b6bfd51a6ca35fc40a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorHandle::handle_inbound (cognitive 19): ActorHandle::handle_inbound has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e234b97cd1c73b0905a32becf2983e5414ee92f14dcbd8304dcfc7d0c65ec3c"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_v2_migrator::migrator_machine::executor::run (cognitive 19): pegboard_v2_migrator::migrator_machine::executor::run has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 10 (19 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/migrator_machine/executor.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0161883a4e215ab0da244a0e71d00dd897c30cd7c2c9705e18476a3585ff7716"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_prefetch::overflow::chain::decode_row (cognitive 19): sqlite_prefetch::overflow::chain::decode_row has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/overflow/chain.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6328d5f6d9069f6c0e5e0bff1484732ed8a33325a74ec4c36df8d019676390"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_topology::discovery::list_storage (cognitive 19): rivet_topology::discovery::list_storage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/discovery.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22d95a3d83721f89a3fe89856eb647a81e0a3994dd3144fe9de3fd0d9d9f0f5"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_topology::topology_machine::lookup::handle_lookup_endpoint_response (cognitive 19): rivet_topology::topology_machine::lookup::handle_lookup_endpoint_response has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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":"engine/packages/topology/src/topology_machine/lookup.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d643c7cd78e7f24fd8a145fb91f63fa6d86a0ab6d1d38bfe9613f765250556ad"}},{"ruleId":"D2","level":"warning","message":{"text":"PubSub::drive_channel (cognitive 19): PubSub::drive_channel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/universalpubsub/src/pubsub/channel/client.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbee3b9b4b14b4fcc16113e83e5a99d5ded411440cbde9b2f2c2e0b900e38466"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::tunnel::handle_request_start (cognitive 19): rivet_envoy_client::tunnel::handle_request_start has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 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":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e784b99a83e062ccd2002aea944293ad102d83f28320a16f31a5ef6e47b8d4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryDispatcher::stop_actor (cognitive 19): RegistryDispatcher::stop_actor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ff4f1ed818fc9ebe2e91e8fb98807884d6321f472d2f9f84cfe1d0c2e20b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_core::registry::actor_connect::encode_actor_connect_message_cbor_manual (cognitive 19): rivetkit_core::registry::actor_connect::encode_actor_connect_message_cbor_manual has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/actor_connect.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5501efd5a4461887ad96e0ddda5e723caa5979ac6297a5819eeeaab7cf8295"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_shared_types::actor_key::slash::deserialize (cognitive 19): rivetkit_shared_types::actor_key::slash::deserialize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/shared-types/src/actor_key/slash.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"39efd52a6ed8bdd615450a474b28dd6b198d4b941941a6d6789c30942097a680"}},{"ruleId":"D2","level":"warning","message":{"text":"lifecycle-errors.classifyActorError (cognitive 19): lifecycle-errors.classifyActorError has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14bc82c6569a30b0edf6c50f6412de8d5bc268080447b2027b2a709b4939a55"}},{"ruleId":"D2","level":"warning","message":{"text":"actor-websocket-client.buildActorQueryGatewayUrl (cognitive 19): actor-websocket-client.buildActorQueryGatewayUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/actor-websocket-client.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cbb8af32fac3ccca1911fd652c322f28b51e111c29ffe5576b7e0055b0b2cd"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_api_public::actors::list::list_inner (cognitive 18): rivet_api_public::actors::list::list_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/actors/list.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3010656544ec05e93174730eb461e743288b004ae82d29ac2d5be0efc8a41f70"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_auth_jwt::planner::reconcile_issuer (cognitive 18): rivet_auth_jwt::planner::reconcile_issuer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/planner.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bdfa11568598e2073c4386e14d1f740278c32ce5aa5fdbaf4f92ab2aeebc2c"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_config::add_source (cognitive 18): rivet_config::add_source has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/lib.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"448033fbaad6360d34ef84410b10ef889c598817da13280f37496352737ac30a"}},{"ruleId":"D2","level":"warning","message":{"text":"LogShardExecutor::write_to_disk_with_roll (cognitive 18): LogShardExecutor::write_to_disk_with_roll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, 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":"engine/packages/depot-log/src/log_shard_machine/executor/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"9049c959e3b7e87a523dc42c3d32c82f5f8aedd8960ae5685bcec7d6d18c8b33"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_log::log_shard_machine::runner::run_io (cognitive 18): depot_log::log_shard_machine::runner::run_io has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (11 pts), if/else 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/runner.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0d37bbe084dad9adece615dbc3c8c5899f517c6a80b3d0536a9dba76a6c7f2"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::waiting::dispatch (cognitive 18): depot_volume::volume_client_machine::waiting::dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/waiting.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d807a52d3703561affba766e2779868abf5661010afe2df357a4301848fec0e"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadSession::versions (cognitive 18): ReadSession::versions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df8999d7bd3b2d82694144ff9d1bf2016718877f316761efb097159798fc2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::copy_fork_metadata (cognitive 18): FilesystemStore::copy_fork_metadata has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1e52f97f1c6305242c8753ee6519be0b31d09181cc0cbdb4a475526749e8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"TabletSupervisor::operator (cognitive 18): TabletSupervisor::operator has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 3 (6 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd26dc5244bec80ce36984f58966b94898cc6893e26c3807898b0bc63e2e7bd3"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_coordinator_machine::state::apply (cognitive 18): depot_worker::tablet_coordinator_machine::state::apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6dc6050c7f75280edbada076824ffe73356023534796c872a6e813010a043b"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::catch_up::progress::capture (cognitive 18): depot_worker::tablet_maintainer_machine::state::catch_up::progress::capture has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/progress.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fe97db6122d4f8e4e5350c31671c6500923d3a8a629517cb380e2f8029eb45"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::cold_pass::dispatch (cognitive 18): depot_worker::tablet_maintainer_machine::state::cold_pass::dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/cold_pass.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefe2e5a97f0630e8b10890c4f51d7e68fce675c52617b8de6ebd6c829f1f161"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::replica (cognitive 18): depot_worker::tablet_maintainer_machine::state::deletion::replica has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb92b86f3b7aa9b52e8e4e886b9da2451faefe8ea51f1c06067e3ae39218e91"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::poll::observed (cognitive 18): depot_worker::tablet_maintainer_machine::state::poll::observed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea3a483cbc41fb4542dfa5b15f8be1a109b233ece1385c6dbe4ae4346136440"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_env::backends::production::slatedb::remove_files_under (cognitive 18): rivet_env::backends::production::slatedb::remove_files_under has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/backends/production/slatedb.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1ebbacc3d0bc76e1aeb0a8ef79aa5dd59b578ecc4e8e73301fc57a74eb36d5"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::actor_machine::needs_allocation_at_version (cognitive 18): pegboard::actor_machine::needs_allocation_at_version has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), boolean chains 7, if/else 2 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f69263b600989090505e6060165972a836711366cb8e4b6b057ae99e31b1411"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::legacy_backfill::finish (cognitive 18): pegboard::legacy_backfill::finish has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 5 (6 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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5187b82a56b8d143dcfffd0fdb837e8599807eed479d7e65419c282e194065e"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::legacy_backfill::probe_bucket (cognitive 18): pegboard::legacy_backfill::probe_bucket has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdff42321fa2a278170b8e32745306f68b0c85d9a6cfcd1070226ac98188e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::legacy_backfill::move_actor (cognitive 18): pegboard::legacy_backfill::move_actor has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 8, boolean chains 1 (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8d2494fc0cc370be0657e7927e33fc8ac856f5cd433b8f34c128651a5f0bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Chain::from_pages (cognitive 18): Chain::from_pages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/overflow/chain.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"495036aed6ea75722bc7f3807ec5418ca58adff1290d040a0dbc294764525d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"OverflowMap::advance_walks (cognitive 18): OverflowMap::advance_walks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 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":"engine/packages/sqlite-prefetch/src/overflow/mod.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"40511b4c77267f45fa9f9f96d5ca0b96dbfcaf54cfa73573d029122e570a492f"}},{"ruleId":"D2","level":"warning","message":{"text":"universalpubsub::pubsub::channel::frame::batched (cognitive 18): universalpubsub::pubsub::channel::frame::batched has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (8 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/universalpubsub/src/pubsub/channel/frame.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"539661f996f40a06bf56d1e32729aac8e80cda68606a7b0bac53a329cb9bdbfb"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteProfilingMetrics::from (cognitive 18): SqliteProfilingMetrics::from has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/config.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d070ff19bad7cfa1ead2ee2704dc4f4ae6736df620ca4ecb1c5a0a2471168c9"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryDispatcher::active_actor (cognitive 18): RegistryDispatcher::active_actor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f456fff25ca838b3e3b011e851b3821dd449c905e68e1bd15e50f24e665861"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_core::actor::sqlite::tx::insert_terminal_state (cognitive 18): rivetkit_core::actor::sqlite::tx::insert_terminal_state has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfaaba504e6953763f46e03c3638b1892641c5a9a44ef4d99bb0cdb2bde68ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreRegistry::health (cognitive 18): CoreRegistry::health has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (4 pts) (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":"rivetkit-typescript/packages/rivetkit-napi/src/registry.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d03a43b790582ff9b7886f48e516d3895bf801ee6de404b444775f343c654c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.RegistryConfigSchema (cognitive 18): index.RegistryConfigSchema has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, ternaries 5 (6 pts), if/else 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfe36b6f001089a5dec5f9bd530a1342599554386afd042f91372c6f36b24b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorConnRaw.#setConnStatus (cognitive 18): ActorConnRaw.#setConnStatus has cognitive complexity 18 (threshold 15). Drivers by points: error handling 3 (8 pts), loops 3 (5 pts), if/else 3, 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded26826f7080dfe21c8d31dbec2006ca63889acbf9fb6d02da771b34d1de7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry.handler (cognitive 18): Registry.handler has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, boolean chains 5, error handling 3 (5 pts), loops 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a7b73b252eaeccbbd0dbdc1d573dfafafe0a0f6980963b59e5026a05efdfe3"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowContextImpl.executeTry (cognitive 18): WorkflowContextImpl.executeTry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c0f407095740ea58feb47205db3355533723764d03673ac8f90679d0e463b6"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowContextImpl.executeQueueNextBatch (cognitive 18): WorkflowContextImpl.executeQueueNextBatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"084207d25a732e94482fb97bec0a7822d8c1dfafec70b8c62e183beadc671e67"}},{"ruleId":"D2","level":"warning","message":{"text":"Filesystem::read_open_view (cognitive 17): Filesystem::read_open_view has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ecb43f0e5f0e62a972640bb35d5845317fb29e0918aa19d0bacc83145c072e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaimSnapshot::chunks (cognitive 17): ClaimSnapshot::chunks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/remote.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3f4a17b6d05644dc36f621bcbf9bfd3794890a07f6a0922eefdf51f35084a4"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_log::log_shard_machine::state::loaded_volume_replica::admit (cognitive 17): depot_log::log_shard_machine::state::loaded_volume_replica::admit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbc4a3a5a0722dfaf81d757f1709dfe6c87ffd0d6296167048445d90555a0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemStore::plan_flush (cognitive 17): FilesystemStore::plan_flush has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"954c88af43135a7c266a07aa2683586e7c93ca6abc131e9b49225619af11269c"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::alarms::park (cognitive 17): depot_worker::tablet_maintainer_machine::state::alarms::park has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1 (nesting depth added 9). 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7ded7a9b5acfbb0cfe112862eb8b7529a24112e6ee225eb968439b81633ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::footprint::validate (cognitive 17): depot_worker::tablet_maintainer_machine::state::footprint::validate has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (8 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"3316de7d4d0ba98e530bb725eff42cc9187fc7a4871aec9a725dd2506e331ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::forks::peer (cognitive 17): depot_worker::tablet_maintainer_machine::state::forks::peer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 pts), loops 1 (2 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfc9ff8d215f69adee9cf3047acf6ed44479ce68e13940add3398a661b561b5"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::after_claim_entry (cognitive 17): depot_worker::tablet_maintainer_machine::state::maintainer_log::after_claim_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"252790f7f29d6d5c0f095db470b629054a167b145c8548d98ee100eb1e4b2dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::maintainer_log::arm_due (cognitive 17): depot_worker::tablet_maintainer_machine::state::maintainer_log::arm_due has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"154388c686ccca016b4d37a79e80657c1e8947985ef0360f4e489c32e40f6569"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::opening::listed (cognitive 17): depot_worker::tablet_maintainer_machine::state::opening::listed 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/opening.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9351bec885f4ef135878787242be86fb64a0b63d7163e0f74d86a4dd7ac5f406"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponseBody::poll_frame (cognitive 17): ResponseBody::poll_frame has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/guard-core/src/response_body.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54029e08336eb67b0bdacf5f6694f1436e8e91d521054cb77907be1c205b409"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::legacy_backfill::plan_move (cognitive 17): pegboard::legacy_backfill::plan_move has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"911ebf1fea36e0a8607ae60bd960c9f568a485b52386128c3766873f5bd4c03d"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_envoy::routes::connect (cognitive 17): pegboard_envoy::routes::connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 6 (7 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/routes.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"380638e043cc94de73928caa5cb428108eb1622167cfbc1f96616cab5d444916"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_gateway::routes::forwarded_headers (cognitive 17): pegboard_gateway::routes::forwarded_headers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6e7497fd27c2280e8916837197d1ac5844780e19a385d434ac72b8060446ac"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_v2_migrator::import::stream_once (cognitive 17): pegboard_v2_migrator::import::stream_once has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/import.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"06de16d7b48f0c8ba095a6d14461407ec1e6be9947424d3d9b03f91b3f3b56c7"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_v2_migrator::migrator_machine::persist (cognitive 17): pegboard_v2_migrator::migrator_machine::persist has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"78abf04207611175fcb233c6652bffd020f147f9eb2bf0d1fc6f274f36f263fd"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard_v2_migrator::services::migrator::start (cognitive 17): pegboard_v2_migrator::services::migrator::start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/services/migrator.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2ef6bc28643dc4335747e3fb40e924c7cc463a47dceaf8e64a15d796f868af"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_embedded::pager_cache::x_fetch (cognitive 17): sqlite_embedded::pager_cache::x_fetch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 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":"engine/packages/sqlite-embedded/src/pager_cache.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb84178ee90b064ddd2b05b2054e5e1abe2bc0666a44f946190b246bffd3f9bd"}},{"ruleId":"D2","level":"warning","message":{"text":"V2Predictor::predict (cognitive 17): V2Predictor::predict has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"engine/packages/sqlite-prefetch/src/harness/readahead.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"239bb39ca54f1f5102766d66b89367cc4b0908aa8b34b5f5ab76edba39c2041c"}},{"ruleId":"D2","level":"warning","message":{"text":"OverflowMap::committed (cognitive 17): OverflowMap::committed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 6, boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/overflow/commit.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"25de4634e3cab8d8f3aad810f5da6dc273d9b93d5e76708046ff7e71e67439c7"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_prefetch::harness::oracle::check (cognitive 17): sqlite_prefetch::harness::oracle::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d940c92b754b993f9d203375fbdc709bfc86dfdde845f744c53b81b8fc01d7be"}},{"ruleId":"D2","level":"warning","message":{"text":"sqlite_prefetch::harness::trace::parse_selected (cognitive 17): sqlite_prefetch::harness::trace::parse_selected has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 2 (4 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":"engine/packages/sqlite-prefetch/src/harness/trace.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a511479317ba6589df1ab0edd3355373dcf516ee0797432579a77c9001e53ea"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryDispatcher::handle_raw_websocket (cognitive 17): RegistryDispatcher::handle_raw_websocket has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c5c941109e56273329c6bcd0749130e4a877e3c34c92aa1bd691f2f727beb1"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreServerlessRuntime::start_response (cognitive 17): CoreServerlessRuntime::start_response has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/serverless.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a7e10fcc85535df17d217a8542f830ba56d55ec71085ef22ae11d423ed01f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_napi::napi_actor_events::run_preamble (cognitive 17): rivetkit_napi::napi_actor_events::run_preamble has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1f6e5ccc5ee350dfd77c775759b97a922c38af9a72b46efeb16c0bcdf172be"}},{"ruleId":"D2","level":"warning","message":{"text":"ActorConnection.connectLoop (cognitive 17): ActorConnection.connectLoop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), error handling 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f44a68ed1e78cc64bc891b74c2f14245e8c494b17fc078ce833bcd29da3c3b"}},{"ruleId":"D2","level":"warning","message":{"text":"ActionDispatcher.make (cognitive 17): ActionDispatcher.make has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 61, 85). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/ActionDispatcher.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cccf59a22ca579fc16470451c92fe5c1f2ec89eaf185dc8100373d6e7055d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.stringifyError (cognitive 17): utils.stringifyError has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), error handling 2 (5 pts), ternaries 1 (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":"rivetkit-typescript/packages/rivetkit/src/common/utils.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6044fc4384dbe050a640cf3386dc8b90a11437d665d9a1b99e2ba2bd169c193"}},{"ruleId":"D2","level":"warning","message":{"text":"mod.workflow (cognitive 17): mod.workflow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 2, ternaries 1 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 4 function items inside it that branch (run, a function literal at line 214, getWorkflowInspector, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/mod.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66ba49755145f861ca22b2bcb7fe3734351956ce00d86802b524881513cac98"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_api_peer::volumes::handle (cognitive 16): rivet_api_peer::volumes::handle has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (6 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-peer/src/volumes/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"203bc1cb055779332fcffe03ef9729599057b9c3d22a55c75786b36bfba3512b"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_cli::commands::deploy::cluster::wait_for_build (cognitive 16): rivet_cli::commands::deploy::cluster::wait_for_build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/commands/deploy/cluster.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28c8b438f6dec6a912c13269c3b1028c0e50dcbf285ceb40e75e26def8c85b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Filesystem::await_commit (cognitive 16): Filesystem::await_commit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/recovery.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ace506b0e71e4c2d42430ae359092cbdf4bcb08528a9260ce4bb4a39e7142d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Slot::create_locked (cognitive 16): Slot::create_locked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c466246f0c8750ff4bfc27459ffb85c28887cc28cebb5a923b2b171ae61c8ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_fs_core::keys::slatedb::encode_row (cognitive 16): depot_fs_core::keys::slatedb::encode_row has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 10 (16 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"33691ccadce546b4a9d1bb0c49c03ef5408bb1b480963b2b5137ddf6c046a29e"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_volume::volume_client_machine::repair::fetched (cognitive 16): depot_volume::volume_client_machine::repair::fetched has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 4, match/switch 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab4ec3d535632ed324e62508f9c93b5ea18295bdcb2e9558577ee0e3f739670"}},{"ruleId":"D2","level":"warning","message":{"text":"VolumeHost::open (cognitive 16): VolumeHost::open has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (7 pts), if/else 5 (6 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb16217cfdb6e30cff5f9791f5b8d36099192067e5ea8ff7458c1c50c7f331f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Balancing::status (cognitive 16): Balancing::status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/balancing.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4022daca3fd8196e4c4a15c02e92c1f15485110883bc45c1d328b3447f3c02"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::cold_pass::select (cognitive 16): depot_worker::tablet_maintainer_machine::state::cold_pass::select has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/cold_pass.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bea1c35921a95ff9f63339f655aa69e03a2f219193ff7c5602dff268feb85e"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::drive_pin (cognitive 16): depot_worker::tablet_maintainer_machine::state::deletion::drive_pin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5e0cdba763b0e9542f98ad9590dac74fb74fb8f575ad20489994cba578a271"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::deletion::swept (cognitive 16): depot_worker::tablet_maintainer_machine::state::deletion::swept has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1813cbff444566e05f995af0834f20be52e90dd231c7fdf8a7199a1b8efd90"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::fork_references::source_ready (cognitive 16): depot_worker::tablet_maintainer_machine::state::fork_references::source_ready has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1712fe58d50751eaea0c7ef7e680fb2052af53927e948bf045b2687d52d1d92"}},{"ruleId":"D2","level":"warning","message":{"text":"depot_worker::tablet_maintainer_machine::state::materialize::stored_job (cognitive 16): depot_worker::tablet_maintainer_machine::state::materialize::stored_job has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/materialize.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"765a9e3a9713e9bf326c6dcf03bcff316122d484904bf92665ec98f9d3d1b54c"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_error_macros::derive_enum_error (cognitive 16): rivet_error_macros::derive_enum_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a0daf19ce07aae2eaa040521fa6049e206c8081c762663a7a8ecec72fe8463"}},{"ruleId":"D2","level":"warning","message":{"text":"pegboard::index::ensure_active_envoy_versions (cognitive 16): pegboard::index::ensure_active_envoy_versions 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":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd850e8f546212311f77c28f32b96365ccbd9708422cae3832ed47ddb7aff517"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_singleton_coordinator::singleton_coordinator_machine::publication::event (cognitive 16): rivet_singleton_coordinator::singleton_coordinator_machine::publication::event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/singleton_coordinator_machine/publication.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b44a679811173c78bde49d8f3b95e0a6221b6c64bb420708a7e3d3f0459e93"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSlot::run_one (cognitive 16): DatabaseSlot::run_one has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb278f9605ba88053cc5529d463a2e772a76aef8c8ff0624f77980f8867d4f01"}},{"ruleId":"D2","level":"warning","message":{"text":"OverflowMap::follow_free_list (cognitive 16): OverflowMap::follow_free_list has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/overflow/commit.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a69eba93cb8f08026b048f1adc8437bd64ac19fc05acafa70f868f9438b5b8"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_topology::topology_machine::lease::handle_initial_heartbeat_read (cognitive 16): rivet_topology::topology_machine::lease::handle_initial_heartbeat_read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 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":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaec5cb6d616a450182edcb022ae370f048f61961c52893bf496d8949b721ca"}},{"ruleId":"D2","level":"warning","message":{"text":"rivet_envoy_client::connection::native::connection_loop (cognitive 16): rivet_envoy_client::connection::native::connection_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/connection/native.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"99948c427c5a541d0656f6ab9c32ad2c20f4619128e98fa0346242a126bb1b14"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDb::close_backend (cognitive 16): SqliteDb::close_backend has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4491c4944f8520fc02bdee8cc7d4dd15f0bb28a20dbe6fbe04aa5a27ce7b16"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryDispatcher::start_actor (cognitive 16): RegistryDispatcher::start_actor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2c98707146bdc0a5da2a708d480de7ffa3081f148008e9ab7948935a6101f9"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreServerlessRuntime::ensure_envoy (cognitive 16): CoreServerlessRuntime::ensure_envoy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 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":"rivetkit-rust/packages/rivetkit-core/src/serverless.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4468f02594841112bb38c0699cf05fbb648f2b204fb03093fc09b8b766a8c3"}},{"ruleId":"D2","level":"warning","message":{"text":"rivetkit_napi::napi_actor_events::run_event_loop (cognitive 16): rivetkit_napi::napi_actor_events::run_event_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 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":"rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0bf4a648e584b37723b7db4411a73253c538fefddd59fff850aad9a64becc4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ActorContext: TooManyMethods \u2014 381 methods, declared across 6 files: actor/context.rs (162), actor/state.rs (71), actor/schedule.rs (47), actor/sleep.rs (44), \u002B2 more file(s). The bar is 30 methods; this is 351 over it, 12.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea98df95f114cc9e638fe5af5f39d6f5febb206a07eb1fd82a4f6f836f400c3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: native.buildNativeFactory: FunctionTooLong \u2014 buildNativeFactory runs 1196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1096 over it, 11.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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aefee601b47abc3e373f23a4296ab6f62bea1f550600b5b0f6d6447b01940a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/native.ts: FileTooLong \u2014 4130 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3630 over it, 8.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f381944689a8bf2e3c851768025ed0b0cca710c6f01296d6be990f920e82ad16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorStateMachine.on_event: MethodTooLong \u2014 on_event runs 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 716 over it, 8.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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36948226bd1ee519e802d50ed545396e03b56b1191a90d456b995c5b50885b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: traces.createTraces: FunctionTooLong \u2014 createTraces runs 803 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 703 over it, 8.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":"rivetkit-typescript/packages/traces/src/traces.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55e1488da59c68f033938b3da696fe797eba7982c94936381ddd095a98c496a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaintainerExecutor.execute: MethodTooLong \u2014 execute runs 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 486 over it, 5.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"7986e1f6b6c67631cc9852b8bdb97eec6383458895188a9cea12eacf346b33b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_log::log_shard_machine::state::loaded_volume_replica::admit_mutation: FunctionTooLong \u2014 depot_log::log_shard_machine::state::loaded_volume_replica::admit_mutation runs 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) in one body. The bar is 100 significant lines; this is 476 over it, 5.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":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d130ad376cd72a735644d8b81619fde09f6a53c542a156644b762a2e9c7a5f4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vfs/transport.rs: FileTooLong \u2014 2866 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 2366 over it, 5.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd3461ef4f9b3b32aa6e7fb33be785c6c3b65fc3ff3705ccadc7684ae98e230"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tablet_maintainer_machine/runner.rs: FileTooLong \u2014 2831 significant 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 2331 over it, 5.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdb64ae966ec41426187ad71868c904e96c52a21bd40b9a490fadaabbccd230"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FilesystemStore: TooManyMethods \u2014 167 methods, declared across 17 files: filesystem/store.rs (39), filesystem/forks.rs (21), filesystem/checkpoints.rs (17), filesystem/fork_references.rs (15), \u002B13 more file(s). The bar is 30 methods; this is 137 over it, 5.57\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":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfcbfa169f51a8f7412915ef3c05380bacb6fa71aab87aa5461611dba47452a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorMetricCollectors.new: MethodTooLong \u2014 new runs 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 420 over it, 5.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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e30cd6e6e69b258187211e7bf401cab640f3b592bf8afc2268be4db9e128cad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/metrics.rs: FileTooLong \u2014 2598 significant 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 2098 over it, 5.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bf9866dec082374e90763e5bbb9eb45239f465223702832657c6a1ea73f0f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor_machine/mod.rs: FileTooLong \u2014 2541 significant 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 60 free functions. The bar is 500 significant lines; this is 2041 over it, 5.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5683d1d5980b7ead8570ae5a92cddb9b25bc8f613451b9082f0945d2e323c968"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2506 significant 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 72 free functions. The bar is 500 significant lines; this is 2006 over it, 5.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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b595dfe7853a8d377b17f98c9b6441147041ca9165c6403ad7f04abe1cdf623b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::runner::store_io: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::runner::store_io runs 480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 380 over it, 4.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cf9aeec19b24dbde0f3b1d80c285c1e6f9e9382bb1c8c563784529f4624176"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogShardExecutor.open_with_payload_retention: MethodTooLong \u2014 open_with_payload_retention runs 473 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 373 over it, 4.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/executor/recovery.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa48b57caec5e4f1a469e19461964672936d5b69a92c3177454c479893cde1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TabletMaintainerMachine.on_event: MethodTooLong \u2014 on_event runs 470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 370 over it, 4.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"63669a3611c84b32227c7be049a2ddb6dc0cd698c3310ed0b97f2f36d7b22daf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Filesystem: TooManyMethods \u2014 140 methods, declared across 9 files: filesystem/client.rs (90), filesystem/txn.rs (12), filesystem/recovery.rs (11), filesystem/file_batch.rs (7), \u002B5 more file(s). The bar is 30 methods; this is 110 over it, 4.67\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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adb6fef0be92c4c201b573aeb862ab1afb4087c3b35fc8b2f0f890781b6a313"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Maintainer.start_with_alarms: MethodTooLong \u2014 start_with_alarms runs 453 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 353 over it, 4.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87ccff7959971a43b32a6a93f5aab932491809acf8e00cdc4cbc12505402e49"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorTask: ClassTooLong \u2014 1798 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 77 methods, 2 blocks, lines 318-3006. The bar is 400 significant lines; this is 1398 over it, 4.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a081e07f529a33bc0aedf0b50b3198728fd6510ed9af8672c4227d46dc038b17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/connection.rs: FileTooLong \u2014 2209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 1709 over it, 4.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"286f1ee2820f2f77591c3d6e780dd43d53d8d0e76df9fd66c398a38fec190e3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/filesystem.rs: FileTooLong \u2014 2202 significant 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 100 free functions. The bar is 500 significant lines; this is 1702 over it, 4.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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"709e3e9ddc52b686d481471b11d0f9562b004da5d58058b6ebdc14a7fd2e2cd8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NapiCoreRuntime: TooManyMethods \u2014 129 methods. The bar is 30 methods; this is 99 over it, 4.30\u00D7 the bar. Most of these members implement runtime.CoreRuntime (123 of 129 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":"rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ee9c6d3ecf058aa431df1053e5b85dd63e3efce92b4c293c6f0e6c34de101a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Executor.execute: MethodTooLong \u2014 execute runs 422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 322 over it, 4.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":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ee16e35a79ffd6263fe9a4bb856f9e558d885a924251b580fbb21f66809095"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/task.rs: FileTooLong \u2014 2056 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: ActorTask (2 blocks, 318-3006). The bar is 500 significant lines; this is 1556 over it, 4.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"210b8ed1172c7e7d8da687cb6712ec96181917ebeba39716d5a465a35f60e969"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WasmCoreRuntime: TooManyMethods \u2014 119 methods. The bar is 30 methods; this is 89 over it, 3.97\u00D7 the bar. Most of these members implement runtime.CoreRuntime (117 of 119 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":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d093cc90af35dd53e548715d50bb038b665fc3cb78a8c6bb0c444bfce0f2c813"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: versioned/v8_v9.rs: FileTooLong \u2014 1924 significant 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 256 free functions. The bar is 500 significant lines; this is 1424 over it, 3.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8570f7cf05bee1a360b7525c47dfee8756e676a32519b3b44b91cd693863de68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/config.ts: FileTooLong \u2014 1913 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1413 over it, 3.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":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cf6d2c41b28671912ce1487be33cf48ecf9eeaf25db5781e49360cad82646d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.ts: FileTooLong \u2014 1887 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1387 over it, 3.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c82f5f30ca4f1d8001726f5ceed8f2ead69121a0dbcb238f7ff813a65c3158"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqliteDb: TooManyMethods \u2014 112 methods, declared across 3 files: sqlite/mod.rs (74), sqlite/tx.rs (29), sqlite/deferred_bootstrap.rs (9). The bar is 30 methods; this is 82 over it, 3.73\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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f238c41084b1197d28ff204f3290badb127d42fba2c3e7c0079869e4396a41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::services::storage::run: FunctionTooLong \u2014 depot_worker::services::storage::run runs 369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/services/storage.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc2f2fb7ca40c4774aa05d1713e9c3a3984a2106fbe6b0ad38de3b65f7e7fa5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/legacy_backfill.rs: FileTooLong \u2014 1834 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 66 free functions. The bar is 500 significant lines; this is 1334 over it, 3.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e9e0fdee0fb6a4c1a86d74d9bf5a31e7355358cfd04b0c3cff6ac5b6c842c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/metrics.rs: FileTooLong \u2014 1824 significant 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 1324 over it, 3.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe2dc467b02d5661f8d63f93b214369f1ab62add858e06f2d0c49e6220cb816"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Filesystem: ClassTooLong \u2014 1430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 140 methods, 2 blocks, lines 319-2442. The bar is 400 significant lines; this is 1030 over it, 3.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95d4c21a3585768996e4f9523e4abb3002a9ac0b697ea490c42e5c742b8e4f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ManifestExecutor.execute: MethodTooLong \u2014 execute runs 355 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 255 over it, 3.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a388712ce2ad64204afdc870d63aaadfcae9cfe750033bd9a94559c2b902b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/routes.rs: FileTooLong \u2014 1761 significant 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 1261 over it, 3.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public-shim/src/routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"574bc8bf3c72c5e94e5844f6a508d8c587070c1ddd346e7f58ebd62551a789dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TopologyExecutor.execute: MethodTooLong \u2014 execute runs 345 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 245 over it, 3.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/executor.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d02a91e983cbcfabdee95478a9128814673dd04bc3b46e96664ea729dfe437c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: command/volume_host.rs: FileTooLong \u2014 1707 significant 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 63% of them inside a single declaration: VolumeHost (3 blocks, 750-2334). The bar is 500 significant lines; this is 1207 over it, 3.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7729d343209811686923eb73481a3a1aa572e708e4a5a84b7cfa8b1cd43ba3dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/groups.rs: FileTooLong \u2014 1691 significant 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 89 free functions. The bar is 500 significant lines; this is 1191 over it, 3.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04014120e8d77d85105853becfb85f154d0d71e7fe1132d5c673b24b25a4834b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/client.rs: FileTooLong \u2014 1662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: Filesystem (2 blocks, 319-2442). The bar is 500 significant lines; this is 1162 over it, 3.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b0a88e7503ebe1e6727989b82408e9fbda4cdded6a37644dcf4fd837fd13d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/lifecycle.rs: FileTooLong \u2014 1629 significant 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 44 free functions. The bar is 500 significant lines; this is 1129 over it, 3.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f20847ad8ff5060b19aea5e6d94605b677c6990f9e68edf91b8622301fab5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TabletSupervisor.reconcile: MethodTooLong \u2014 reconcile runs 325 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 225 over it, 3.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":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"617663b217fd268436f9c6b2026d851c186ba7ca31113aec60e1a7aed5cad354"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/loaded_volume_replica.rs: FileTooLong \u2014 1563 significant 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 1063 over it, 3.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"132b60c9f77d07ae92497d27554ce47a04e9122951233c634b89114e5bf0e674"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivetkit_napi::napi_actor_events::dispatch_event: FunctionTooLong \u2014 rivetkit_napi::napi_actor_events::dispatch_event runs 306 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 206 over it, 3.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3947615b0784cd45b4476fee7cf6f958de402347d6c3204a89db55a8ab26c2e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor_machine/executor.rs: FileTooLong \u2014 1528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 1028 over it, 3.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb5fdc63f2581a0626df3dc372703acc82023a84bb6ffd3f7adaf24845a60b7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ActorContextInner: TooManyFields \u2014 91 stored fields. The bar is 30 stored fields; this is 61 over it, 3.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":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"150fcf91a01142499a744ad7649aea40393577a150f02e450e9d7fdc575f553c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryDispatcher.handle_actor_connect_websocket: MethodTooLong \u2014 handle_actor_connect_websocket runs 302 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"673add7a61d80c0ced5994ceb7419975bd507d221e9e58d93cd4216563f34c51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivetkit_wasm::dispatch_event: FunctionTooLong \u2014 rivetkit_wasm::dispatch_event runs 295 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 195 over it, 2.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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a03960ce88a7cab2a470c501c2ad01da7f98446473607408b0c4ef5a7646f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/catalog.rs: FileTooLong \u2014 1463 significant 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 69 free functions. The bar is 500 significant lines; this is 963 over it, 2.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36408f7f1e1b5f934848547a2e9b07a207111526abe6638af64c9d16f885fbf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tablet_supervisor.rs: FileTooLong \u2014 1462 significant 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: TabletSupervisor (5 blocks, 330-2208). The bar is 500 significant lines; this is 962 over it, 2.92\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d865321bbc16bc02257b26b9857bd3c255f81ddc2f2feb7f582679b0db3a149"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.rs: FileTooLong \u2014 1451 significant 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 41 free functions. The bar is 500 significant lines; this is 951 over it, 2.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7c2211003d12a2af0b299d68c74dcf4af4a50c06de57b01b89ba5d3a71b11b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/forks.rs: FileTooLong \u2014 1445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 66 free functions. The bar is 500 significant lines; this is 945 over it, 2.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bee00438e6718d38091a1ca6350942aba838dc218af8eb8fb980373e9b002eb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorContext: ClassTooLong \u2014 1153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 381 methods, 2 blocks, lines 279-2221. The bar is 400 significant lines; this is 753 over it, 2.88\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":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba352f20a30d3c794c3831160b61b27ff212722215e905d5d62df89d72d3b63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/session.rs: FileTooLong \u2014 1441 significant 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 941 over it, 2.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ea3e92d2888caa1d3a4c66a3b2d949f162da10e45f81ca167bd8f47b80a0bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/context.rs: FileTooLong \u2014 1437 significant 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: ActorContext (2 blocks, 279-2221). The bar is 500 significant lines; this is 937 over it, 2.87\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c0ada215da2838c20f3c306b365d9ebf82569b0175a48f81eb4947058d4534"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VfsContext.resolve_pages: MethodTooLong \u2014 resolve_pages runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"234cafbfb6a16d4d6c2efc7f4ba15d145b715378787461885bec22f07c48187b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/mod.rs: FileTooLong \u2014 1390 significant 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 890 over it, 2.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eb808beb65f31b55b37c3caea8b90e30c4ddb406ddf914b7ce1a6e3215cac5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/worker.rs: FileTooLong \u2014 1384 significant 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 884 over it, 2.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88777958590ab0cfc0566973a504fae66ea3a3d42bb92c6ae25738f6c7f3f45c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlite/mod.rs: FileTooLong \u2014 1374 significant 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: SqliteDb (5 blocks, 121-1787). The bar is 500 significant lines; this is 874 over it, 2.75\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2f2fcf500bc368df3660059cf3b1a9ab2977936b7ab1a9b2f825329ecd486f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MaintainerState: TooManyFields \u2014 82 stored fields beside 15 methods. The bar is 30 stored fields; this is 52 over it, 2.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6924de0f30bfa8986265a76cc9c8edd6ec7a355bc6ef700516d924a9383d49f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Maintainer: ClassTooLong \u2014 1080 significant 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, 5 blocks, lines 267-3728. The bar is 400 significant lines; this is 680 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f97718ec4dbcf4ffcaa66eee48c36ecefe4533d875dc2ee579e2edd468ac06"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VolumeHost: ClassTooLong \u2014 1072 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 3 blocks, lines 750-2334. The bar is 400 significant lines; this is 672 over it, 2.68\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":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"970303dc87071ba2395d189d1985ce3c5bb66fd2bc6812af84a2afbd5e0bfdb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.request_stop: MethodTooLong \u2014 request_stop runs 264 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 164 over it, 2.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f2ce9dffccea2bef79fd79c2c37dd2487995ff67b2dc10c3ef680acd2f6037"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_envoy::connection::handle_sub_stream: FunctionTooLong \u2014 pegboard_envoy::connection::handle_sub_stream runs 263 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 163 over it, 2.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"296e47288c345ba61954403daa6a5aec4d207cf499f768f1c28a8ba1d62e26f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TabletSupervisor: ClassTooLong \u2014 1042 significant 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, 5 blocks, lines 330-2208. The bar is 400 significant lines; this is 642 over it, 2.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6275dde7dfa4495b435bd4014cc8ec39b2e9512938d64585e7f47be258048e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: maintainer_log/mod.rs: FileTooLong \u2014 1290 significant 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 61 free functions. The bar is 500 significant lines; this is 790 over it, 2.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fab11d3cf17e5b3b6e1125a562a31168ad4541c62694d2b9f5f403b8e7becc5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemStore.read_operation: MethodTooLong \u2014 read_operation runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/read.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f305ca68115b36d459b01d136adf8e5ada69af19e604dec2e1be13b8cd0a6db6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ActorTask: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3ea2daad0d9d3849eb43d4d978a6fcb2ddef112e144ca30747c9597f13f74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_envoy::connection::run: FunctionTooLong \u2014 pegboard_envoy::connection::run runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af5a7591bce7d67463f3415d38cca17ec5a2b10e2cdccb0e8354057caf37bb5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SqliteDb: ClassTooLong \u2014 1004 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 112 methods, 5 blocks, lines 121-1787. The bar is 400 significant lines; this is 604 over it, 2.51\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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5594acec0222224e3c7b18788262d7c49ed76da28d13a627228a4a44c41f5021"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ActorContext: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"daed92e49ebd199702bb94cdbad8572aec6e6dcd845d06dfe9238467a47c1778"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: migrator_machine/mod.rs: FileTooLong \u2014 1246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 746 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c173279caf14d5d5a3b1c43636f34d63026e5f7595923392e9bcd21c087c342"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/deletion.rs: FileTooLong \u2014 1231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 731 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cf30bf4637d90d1cac063627f7652f39519996f08492b8d8b7b6d60b901540"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/mod.rs: FileTooLong \u2014 1225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 725 over it, 2.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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1382cc9769797dfec7f2f8c837f53cd92e9928d960ccb806735b4c2603ab1d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VfsContext: ClassTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 47 methods, 3 blocks, lines 701-2474. The bar is 400 significant lines; this is 560 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c9c88568b607a6c7c800c1ffbbdee09b4a5a0785bbe87e5c3b0d795440778a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/cache.rs: FileTooLong \u2014 1200 significant 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 700 over it, 2.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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c806f82ab7453e3602465801c3a2cb989cd390f7eb0637aaa91c251ee4eeede"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlite/tx.rs: FileTooLong \u2014 1199 significant 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 699 over it, 2.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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f1b10ccb4309c72abf19f8f324036df17bc6eef6f2478d59464bdb478835d4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorConnRaw: ClassTooLong \u2014 949 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 549 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3c32d9a99fcf6ef70a39cfbcd1a17bf3e3a1aa4515d572a686e5fce6f1cff3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorMetrics: ClassTooLong \u2014 944 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 6 blocks, lines 155-3245. The bar is 400 significant lines; this is 544 over it, 2.36\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b810ed5eb20cbeaa33127ef83d32741b866b4cd9c4d7b35e1e4726f750c33196"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/unload.rs: FileTooLong \u2014 1177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 677 over it, 2.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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76fceebb08ec84ea44c36e4daac1e43585e3ea5a1aa56301f5cf949b0d52c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actors/workflow-run.ts: FileTooLong \u2014 1173 significant lines (blank, comment-only and punctuation-only lines excluded), about 65% of them inside a single declaration: workflowRun (539-1479). The bar is 500 significant lines; this is 673 over it, 2.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8fe41086c6be8bad9e536fc6e37237f66c864674d1bb6f04beaa7b859af4cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runner.process_attempt: MethodTooLong \u2014 process_attempt runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine-durable/src/runner.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"50550f4599cc929e5d96d7c74127499753de5215da69958ba9dc64ae379e5a7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/schedule.rs: FileTooLong \u2014 1153 significant 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: ActorContext (173-1177). The bar is 500 significant lines; this is 653 over it, 2.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f635e7f2809f844d0948f4d77fd508389c1b13f4e2291d3f83fad257f19f2a5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivetkit_core::actor::migrate_kv_to_sqlite::import_core_state_if_needed_inner: FunctionTooLong \u2014 rivetkit_core::actor::migrate_kv_to_sqlite::import_core_state_if_needed_inner runs 227 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 127 over it, 2.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"62391246ea2e4a32644075ca038cebf5ff0d9a01287c1c44e1f45c1b417cef75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_volume::volume_client_machine::requests::admit: FunctionTooLong \u2014 depot_volume::volume_client_machine::requests::admit runs 226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 126 over it, 2.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/requests.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"70249b99ea913850d15d6cc1fdd66ff71f012d20ad7c210cc835080822083518"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.command_with: MethodTooLong \u2014 command_with runs 222 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 122 over it, 2.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":"engine/packages/depot-client/src/command.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b281815f7320f0963308b4fed6392b74f8942454988a9dbb366292aa16da8f61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/napi_actor_events.rs: FileTooLong \u2014 1085 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 585 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dde45a3ce881390934d83b6857f9a3750525e082fb8015c0acc6f370e57789a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Filesystem.admit: MethodTooLong \u2014 admit runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/admission.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"223f939476d2b2e0c65367d2cbccee0989c561a50b4be296eca1942848148ca7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EnvoyClientMetrics.new: MethodTooLong \u2014 new runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c038555791e27d121f401b9dcd9d20344ff3a7f5dd9439c23f78b804f7056e8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorStateMachine: ClassTooLong \u2014 863 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 463 over it, 2.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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fd5fd64741d03bb4bd6a59beeaefde431a741e9f691bfa19c98d74f4b3bb59"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_envoy_client::actor::actor_inner: FunctionTooLong \u2014 rivet_envoy_client::actor::actor_inner runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5bda043aa160dc08f0518b8e54e07f57cd39f7e3483e7b4c67d2a7ca18fe12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: keys/slatedb.rs: FileTooLong \u2014 1067 significant 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 567 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"806b307e525a02854ffec90828c93265f6483157448550c52765ef26ad408465"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkflowContextImpl: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.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":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8df5f688dd96d0b056d4ac7a5d16b31af05e992abdbb6b64076205b50465ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/actor-conn.ts: FileTooLong \u2014 1054 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: ActorConnRaw (156-1716). The bar is 500 significant lines; this is 554 over it, 2.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b05e227d00f9212ddf6fb473542c9c58102396f8e008a66dfdffff0c033ec49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorTask.start_actor: MethodTooLong \u2014 start_actor runs 209 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5047856f99f374a4acc490e7cc6bd9970ccee481d146671a476abb4959ed0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal_storage/mod.rs: FileTooLong \u2014 1043 significant 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 68 free functions. The bar is 500 significant lines; this is 543 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aacd25bfca2f315811f5eb650819b4092e2b8d80b53d3b5c9581d0a07d90ecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::lifecycle::admit_open: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::lifecycle::admit_open runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e36ee81cc5469922a81bef8a5f8611fc24bbf821233b13d9812c214c52a259"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: topology_machine/lease.rs: FileTooLong \u2014 1033 significant 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 33 free functions. The bar is 500 significant lines; this is 533 over it, 2.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":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c8fa853f8a3554ce4beda758fa3a2e34d013bdd187e934b849c141489793ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/mod.rs: FileTooLong \u2014 1021 significant 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 521 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2ccad742c2c2a3ccb1847af65287fd1884b1c27d90786280134dbe903e4b8b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReadSession: ClassTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 2 blocks, lines 278-1461. The bar is 400 significant lines; this is 415 over it, 2.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed13d4bda5583277280d21a364fe19f877f2575e5c69c40b6c2139141b204bfc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteProfileCollectors.new: MethodTooLong \u2014 new runs 203 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9a4abac56c31fc021afcb1dfc92c97d597ce2b53f8f39ec361f66453d30232"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/actor.rs: FileTooLong \u2014 1008 significant 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 508 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1205349f8116e006209bec5ee995613e6e85a120fabc513f950baf132b29ba2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tablet_maintainer_machine/mod.rs: FileTooLong \u2014 1006 significant 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: TabletMaintainerMachine (206-1034). The bar is 500 significant lines; this is 506 over it, 2.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":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e23dee79a2155e3aaf5687048817b7ed1cac57e31c9f016f5fdc49baed992d5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EnvoyHandle: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6e39272bb90eef59cd9a779da46b50b412727f515a6840e657cdeade920e4c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryDispatcher.handle_inspector_fetch: MethodTooLong \u2014 handle_inspector_fetch runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"935d0a34014f63aa8cfdd0334661528b594ee2d6e52bc7c1cd675d9ed690ddb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/state.rs: FileTooLong \u2014 990 significant 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: ActorContext (369-1510). The bar is 500 significant lines; this is 490 over it, 1.98\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a3855f5e276e5e0b061c995f1e868301f7bdd543976252e437bcb5c4f6c1e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlite/mod.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). The bar is 500 significant lines; this is 487 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/sqlite/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36fd4f947c3ac8f338c259279edd4dd7c263550891369165c1d4ff6829a2353"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DepotConfig: TooManyFields \u2014 59 stored fields beside 19 methods. The bar is 30 stored fields; this is 29 over it, 1.97\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/config/depot.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d09e4ee8e4c81700c94b564af3636c3933ed4538a0fc7416f87da6cd5346ab"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Executor: ClassTooLong \u2014 783 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 6 blocks, lines 187-2025. The bar is 400 significant lines; this is 383 over it, 1.96\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58b6d0e72a30aaa8000025f476cb1302c1924d3f60fa097e0a350146f20332b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::lifecycle::load: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::lifecycle::load runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa36dd1afa2b8f8ddcea058302c39c4ccfe61ea00f7dd8e1e8659a23b241c4ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: volume_client_machine/recovery.rs: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 460 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25006e8d5a48c865ff3b9d551e15675ce1da006c426b27963b98db05a667ed4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryDispatcher.handle_inspector_websocket: MethodTooLong \u2014 handle_inspector_websocket runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector_ws.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f97045bc3f11538fd71d1bd2caf3192b561c69e7a0a0ce3be795b1bd666f4e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: versioned/depot_v2.rs: FileTooLong \u2014 951 significant 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 451 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/depot_v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df2af4408b9ba31b6ecd86f06fd95f0c73fdcdcf7e4950ca228662a7a6088cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VolumeHost.open: MethodTooLong \u2014 open runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec814f34e92afb7aa5b4be78fdfeda330299cef337d0dc623f5f6ad4ca3b18ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::lifecycle::row: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::lifecycle::row runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeab6b4cce188526b9221b9d26c3a10c21d5255fdad0daa1a964119e775d552d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workflow/context.ts: FileTooLong \u2014 946 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 446 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ae052cc39d20b6677a2653009ff91be72bd3d92c467f59453a7b9d3528c23e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_gateway::routes::gateway: FunctionTooLong \u2014 pegboard_gateway::routes::gateway runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bb124dc6b4d5b332bb3a5cdf85de41fcc17ba548785fea65a5851517a859b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/store.rs: FileTooLong \u2014 940 significant 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 440 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2daee3b0e5f9b29bbc2fed28fed5dd8a1078fe2c33ac8f340283f808b570d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_envoy_client::connection::native::serve_connection: FunctionTooLong \u2014 rivet_envoy_client::connection::native::serve_connection 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":"engine/sdks/rust/envoy-client/src/connection/native.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1954f4874140198ab062989329de583c3b94f788c7064083a88fc8bd72305b2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: RivetKitClient/ActorConnection.swift: FileTooLong \u2014 936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 436 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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f53b935858d31f886f33f1856e4310cccd9b84be51ab5c441026ba5803a3fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs: FileTooLong \u2014 934 significant 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 114 free functions. The bar is 500 significant lines; this is 434 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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfa84817de74b307773fe4a38ced8bd00c6f2585f7357f51c2ad68b20ac48c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/napi-runtime.ts: FileTooLong \u2014 934 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: NapiCoreRuntime (266-1298). The bar is 500 significant lines; this is 434 over it, 1.87\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7861016b55eae2892c8f5a5f21e61a4e75c3188d26ad5ee58d0db6075201522"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/routes.rs: FileTooLong \u2014 930 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61198de12a03beb910a583f77269ac528bb257aee1a2aeab85c12155606d7dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs: FileTooLong \u2014 930 significant 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 116 free functions. The bar is 500 significant lines; this is 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a36138738f6579b183fda1d48c976f38c69ad7894d6d661e30ec1920c9191"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs: FileTooLong \u2014 930 significant 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 116 free functions. The bar is 500 significant lines; this is 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cf942ad355ae9c49a054a09fff48fb5cc08e02d0cc76b164e1718b5e11955b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::services::tablet::serve: FunctionTooLong \u2014 depot_worker::services::tablet::serve runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/services/tablet.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3813f7d703c25ceb3b7cb407b79251d2e5b53bc41277c7b80146bacdc7d4b4b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/store.rs: FileTooLong \u2014 929 significant 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: FilesystemStore (2 blocks, 456-1445). The bar is 500 significant lines; this is 429 over it, 1.86\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":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba4a7b27cddcde07bfec5d7c7f08c66d322c322c874834bcc373aeaf7bf9e29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/versioned.rs: FileTooLong \u2014 928 significant 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 428 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6330aa4dd07cd7cbedaa597342ac77e911f74167889336c1878fa6603e1f37a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/fork_references.rs: FileTooLong \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), about 94% of them inside a single declaration: FilesystemStore (4 blocks, 60-1262). The bar is 500 significant lines; this is 420 over it, 1.84\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bff305510566e24b9be5fbcff29bb6983cd9e5c786df586a779abc2a77fbfa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/wasm-runtime.ts: FileTooLong \u2014 918 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: WasmCoreRuntime (263-1305). The bar is 500 significant lines; this is 418 over it, 1.84\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9a32d094bd7ff2658ed9276fc2bb80ab30dd3b794d7066d8f1c6068164a703"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/traces.ts: FileTooLong \u2014 916 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: createTraces (141-1224). The bar is 500 significant lines; this is 416 over it, 1.83\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":"rivetkit-typescript/packages/traces/src/traces.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb8e5073d4632695026ab6f6801ac9117b0226dbdcfa90d2af99af3b358bd15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/actor_factory.rs: FileTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f9c721e58ef9bcc5b0029dd6163de1b29462ac7c0e63adf919ccd60ca3969e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationIndex.apply: MethodTooLong \u2014 apply runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operations.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb80bfe94fad8a8e223e329da4ad47be83d19b48908cf7d4137a2405de15fb59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs: FileTooLong \u2014 910 significant 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 114 free functions. The bar is 500 significant lines; this is 410 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc91eeffbc75e6d52e798b8717a6cb8947d780161008f8bd120685eb35279a0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::lifecycle::loaded: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::lifecycle::loaded 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"99507fcd02cf963ddeb2928697917eb28b00051cc7aa8aedf2f00ce6f12e0340"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorHandleRaw: ClassTooLong \u2014 724 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 324 over it, 1.81\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"637c60c8e3b4712d04a17c4a9a6918cfd58fd398213c264e15b4408d0ae892f1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WasmCoreRuntime: ClassTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded), 119 methods. The bar is 400 significant lines; this is 322 over it, 1.81\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59aef6ce26cdb23fbf4a6dd7f9dc45dc30a560884336b9e7e4bd28df5258eee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NapiCoreRuntime: ClassTooLong \u2014 720 significant lines (blank, comment-only and punctuation-only lines excluded), 129 methods. The bar is 400 significant lines; this is 320 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c161069e36c97c0a98bcc581b799310fea534efb9367ea3138aa58725c5c26"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemStore.checkpoint_change: MethodTooLong \u2014 checkpoint_change runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"71286979f9d888b8781ecea88010a105465fc60ec0c2484948b99f2783b56e59"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_envoy_client::envoy::envoy_loop: FunctionTooLong \u2014 rivet_envoy_client::envoy::envoy_loop runs 180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/envoy.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f3c08cfd084b955e5dabc61a0cf5dbe37359c91ee1e6ae84629414a4cb5bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs: FileTooLong \u2014 897 significant 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 113 free functions. The bar is 500 significant lines; this is 397 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e768d60d045e5d708ad05118af1ab1f0ebcc6501705ad381a816159d10d5209d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs: FileTooLong \u2014 895 significant 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 112 free functions. The bar is 500 significant lines; this is 395 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4366611592a25bef20a339990b4b41db7cee76d361b4769a252c142b37d2af62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_fs_core::keys::slatedb::encode_row: FunctionTooLong \u2014 depot_fs_core::keys::slatedb::encode_row 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":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80cad21412ad78c685be2e3ce04eef72e1b21f6f3eb5820585590ff2616d956"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PubSub: TooManyMethods \u2014 53 methods, declared across 9 files: pubsub/lifecycle.rs (9), pubsub/mod.rs (8), pubsub/request.rs (8), stream/mod.rs (8), \u002B5 more file(s). The bar is 30 methods; this is 23 over it, 1.77\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":"engine/packages/universalpubsub/src/pubsub/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff2c6a006bd99a06d259744e99acad35c607e64f1b166d80affa9ef51b23efa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_fs_core::rollback::plan: FunctionTooLong \u2014 depot_fs_core::rollback::plan 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":"engine/packages/depot-fs-core/src/rollback.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d0a5ffc1f48f370be2f5c19c8e949188b12c3c18b176a2e7474fd56929389b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::unload::drive: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::unload::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cb5537fd97dc9dc70bcd9209015cec92cac7650f6bd49c69fa0b623bc4587b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/forks.rs: FileTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: FilesystemStore (5 blocks, 18-1180). The bar is 500 significant lines; this is 368 over it, 1.74\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad924e5c31cd9251f9868835b53c68221e7083ddc9838773c40023983e9d467"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: namespace_machine/mod.rs: FileTooLong \u2014 867 significant 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 367 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/namespace_machine/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d64da8c49f4f23bf34351619f2d45c3991b9975818708924ff202c3001ffcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Executor.execute: MethodTooLong \u2014 execute runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/namespace_machine/executor.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a547d56bd1a9dc7feb63a8fbbc9061381faf8ed7f4f2410103fada41f70cbb34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: versioned/depot_fs_v2.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":"engine/sdks/rust/data/src/versioned/depot_fs_v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba43ca7cd956eccd5312ae6f3e1b2c5899a2940f2c5a6f2d9ca339e0f5bb0fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ActorMetrics: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b6a84201d4db105af715e46b1f97ba07e60b214428e9d9b31052265ec0e77b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/actor_context.rs: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 347 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0241adecafea3baaaef6050f5e6c36f703e86a12bad58b640b8a744b7eccc59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/alarms.rs: FileTooLong \u2014 845 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 345 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62c2bfe141d647c19447f5dc57d0355bf58f0b48382e86dc6701203092f9d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_v2_migrator::migrator_machine::executor::run: FunctionTooLong \u2014 pegboard_v2_migrator::migrator_machine::executor::run runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/migrator_machine/executor.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea6f435493f303c417dfacaf63348b2d4628110d1c188d088c3e125b86ebbf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/recovery.rs: FileTooLong \u2014 844 significant 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: LogShardExecutor (2 blocks, 76-1155). The bar is 500 significant lines; this is 344 over it, 1.69\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":"engine/packages/depot-log/src/log_shard_machine/executor/recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b72e5443e2a6d60e72dae2b1fec2246e24f98fa9bff24632d32ac60967fadb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ef3492c254b2325e063bdbb6bf92caf16bcc45d9fad6e272a7cf88c72b14b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_engine::run_config::start: FunctionTooLong \u2014 rivet_engine::run_config::start runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine/src/run_config.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"56013fa615652b94bd6c6f96b4fb55ed708c5f430dd506570594ebb3c3f71906"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_error_macros::derive_enum_error: FunctionTooLong \u2014 rivet_error_macros::derive_enum_error runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c769bc25a705f116fd2a5ca0bd9589949bccd3c74d60fda3e1a543761feb89f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 835 significant 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 335 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/engine-process/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c9f5c366cea8a2aa7ea03f69fff8d69f3f06a0154cd2ff6ca122b415c1c6c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 50 methods, declared across 7 files: src/lib.rs (23), src/forks.rs (6), src/regional.rs (6), src/checkpoints.rs (5), \u002B3 more file(s). The bar is 30 methods; this is 20 over it, 1.67\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":"engine/packages/depot-client/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff7892a9fd062e55d889d6b8fae6d54018c902afd0aace3d1dae576d611fffb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ActorMetricCollectors: TooManyFields \u2014 50 stored fields beside 1 method. The bar is 30 stored fields; this is 20 over it, 1.67\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba482b3d1367ef082cbc5e30cfc5a506e00ea96d0db5f51f66547149c22a4290"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FilesystemStore: ClassTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 167 methods, 2 blocks, lines 456-1445. The bar is 400 significant lines; this is 264 over it, 1.66\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece75b4d29150ecfc1ccc786b96d1abfe77eb1c2085129a70dec36b6f901451d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/http.rs: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 329 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eea007fea22b0041a5262339a7a4968847686cf5a4b7c7e9db3820f1d546a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemStore.acquire_fork_reference: MethodTooLong \u2014 acquire_fork_reference 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":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fb6cf89371beb2b2c2ed22251d0bdc4bd1d62c480590c8bee6e8571767454b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlite_embedded::worker::run_command_inner: FunctionTooLong \u2014 sqlite_embedded::worker::run_command_inner 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":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dcc4bf737160b2b587edad9cda4af6607681376f4bab88be0f04f460586453"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/memory_batches.rs: FileTooLong \u2014 821 significant 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 321 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":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"973257d2a3a250a21a8f3b0e2252a16b217e409facb929ef9ee432054f63272c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tablet_coordinator_machine/state.rs: FileTooLong \u2014 821 significant 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 321 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6718e9a693b480e3b8821160187c6104a5ad470741111c22b695f7125c4781"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 102 free functions. The bar is 500 significant lines; this is 321 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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0d28ffa3a2b62587c4e73465c52e80fe2051baf7a0d9916d3e517095e26fef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard::legacy_backfill::legacy_move_page: FunctionTooLong \u2014 pegboard::legacy_backfill::legacy_move_page 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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0d4ad4c6661697aff3f2ed6e18fdbd65087d6662bebdd26496482ac3080de9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: volumes/slot.rs: FileTooLong \u2014 814 significant 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: Slot (2 blocks, 120-816). The bar is 500 significant lines; this is 314 over it, 1.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fbc8a2ce26a6beaf78d2e5ba5b947ae847e63fb0200ca200db592d2da72e28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_envoy_client::actor::handle_hws_restore: FunctionTooLong \u2014 rivet_envoy_client::actor::handle_hws_restore 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":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"337df784c201862202d7a0c5e756b87bd9eac87a150a659122b9d73c20f7443c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/actor-handle.ts: FileTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: ActorHandleRaw (84-1110). The bar is 500 significant lines; this is 308 over it, 1.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5354b1bc13934cd1752696667499bb7bba9f49b30a7fffac63cc48a412b0975"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs: FileTooLong \u2014 805 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 102 free functions. The bar is 500 significant lines; this is 305 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c8d0bc48ab54f4ee12438ff476fb8414acbe8dcb72c59138248c5ea137580a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::replica_response: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::replica_response runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde910a2589a172551717baf39a9930a9c0a9de9a10a16eb15f5bf41ec2ab5a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::store::drive_queue: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::store::drive_queue runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c74f5336f19e861683e695f176ebd556f452d9c3096a8a241c533c2d3f9239a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TabletMaintainerMachine: 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), 0 methods. 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a581e8efdcdb23f1efe4444f23fc030339fb2927dd90c0243cd551ee75545e8e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StoreSnapshot: TooManyFields \u2014 48 stored fields. The bar is 30 stored fields; this is 18 over it, 1.60\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e63885172137c905fbc0ffcf02e2cc12e043461f5b80d9253281b867ced50dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/RivetError.ts: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"rivetkit-typescript/packages/effect/src/RivetError.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fac94bcaa71f5b58625462091ec8ed4b9a82d4c73001f2681aa08fe61a00a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaintainerState.new: MethodTooLong \u2014 new 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8cc61bb82c50fac0f979aaebdbbb8b80c6adac6fb794762b8c2da7c199f1ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorTask.handle_dispatch: MethodTooLong \u2014 handle_dispatch runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b07bf56ba25468db7e31e5b7e9077a8c588d77e1bc5fa5c5872ccde8f37bf2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::groups::read_completed: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::groups::read_completed runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b651cbb47742106832dd29bd7f259dee506179fe546af7a9553d496a1f78e0f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ActorConnection: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74f85de618e4fd738751ccb392704b53c1356067114008f8139959e7539b711"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VfsContext: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d342a133f5d3a4f440665b937b835daa8624e4427f96e44d226f82473f128ae8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Registry: ClassTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 225 over it, 1.56\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4703eb7de95ba58b8a417b07e55aec75010a7e4cb4828e6a5c91cc81bc9b9e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/transaction.rs: FileTooLong \u2014 781 significant 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 281 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baf6ad2c847cffdb0ea3d7496a6efa9a379c55c738c271b6e274cb3298a59e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_api_public_shim::routes::fork_actor_inner: FunctionTooLong \u2014 rivet_api_public_shim::routes::fork_actor_inner 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":"engine/packages/api-public-shim/src/routes.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0e6753d9b0facc8c56581a9077608531d350cfbf8681b30d844f1b390e7098"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryDispatcher.handle_raw_websocket: MethodTooLong \u2014 handle_raw_websocket 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":"rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e144c8b41cd11c56c546acf31d56e33ec6e92112643aa9df2338b34e3e1cfea8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EnvoyHandle: ClassTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 3 blocks, lines 16-980. The bar is 400 significant lines; this is 219 over it, 1.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"212487f72e47ebfa0126651f3fad581eb9d537e2961bf30fc702c4ca69ac51be"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MaintainerExecutor: ClassTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 1530-2321. The bar is 400 significant lines; this is 219 over it, 1.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"0294888bc2be88651bf18ef0f2aa1cfcf30c4caaf7393e93acc90716352a86e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SingletonCoordinator.on_event: MethodTooLong \u2014 on_event runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/singleton_coordinator_machine/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"392a8af40a30990e438e7f1e5d713e7d1a371653c39ab264e12f98b2f84cf904"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/fork_references.rs: FileTooLong \u2014 768 significant 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 268 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e654b9d2178709fe6f58dab0afa7537cc142ede56dcb00ae61a400b90cfbef45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/runtime.ts: FileTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c04072c1fd0398acc683011d51bd6aa61f3c5d676a1eb618ff3312b07edcf8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OverflowMap: TooManyMethods \u2014 46 methods, declared across 2 files: overflow/mod.rs (40), overflow/commit.rs (6). The bar is 30 methods; this is 16 over it, 1.53\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":"engine/packages/sqlite-prefetch/src/overflow/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3e863727b459d4e657d4b3e4bb13ae9bdc4a6ac2f4e03bb1034a8d6bf3c98b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorContextHandleAdapter: ClassTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 213 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb31b1e87a26419de88c8ac34d1395927d222c413d9da93d2405f8714c08e6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/queue.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 62% of them inside a single declaration: ActorContext (242-915). 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":"rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"225f503e63033ca69f0814db4b7ba231dd7b007aa8aef6b4f8ae39de659fdd95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemStore.publish_fork_over: MethodTooLong \u2014 publish_fork_over 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":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd27301b9595b6f61e8a408010733dc0f4fe708c2bddfb758f98d8a38e08065"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverflowMap.plan_commit: MethodTooLong \u2014 plan_commit 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":"engine/packages/sqlite-prefetch/src/overflow/commit.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ca737d77573fadf619a0a0c8627dfe70b7ed2abeee5365e68bacdce730e50e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/index.ts: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: Registry (161-1216). The bar is 500 significant lines; this is 259 over it, 1.52\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":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"007b6a9b6e0c22464a78c38beb8d15ccc8568ce7c081e795a6cf0bdb3cc27f82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tablet_coordinator_machine/runner.rs: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 258 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfad7e2c151dcbdfa77f33c24dd74ab53cea593b2187e71f0bfb7a121a267b21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.executeWorkflow: FunctionTooLong \u2014 executeWorkflow runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afd601f05122eb50f1b1a76ddd53ba00d4170a918e82a25e53adf6da5ad8ab9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WasmActorContext: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e304ad6e4c8152c57e7bee0ebf388990c74e7684d3978e39f575c8338d063b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: VolumeClientState: TooManyFields \u2014 45 stored fields beside 15 methods. The bar is 30 stored fields; this is 15 over it, 1.50\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":"engine/packages/depot-volume/src/volume_client_machine/state.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18ed79369f20f927d36280b12d5c02840e3625c4457dc4e9951d423fd965410"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorMetricCollectors: ClassTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 2 blocks, lines 219-1867. The bar is 400 significant lines; this is 200 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f013b6e5731aac5ebebeba0a8655d03dd690e897032acf7868f5557251b220"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: State.balance: MethodTooLong \u2014 balance runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/balancing.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fc5b97d40aa039f54cb8e7118d1c8cdf276722f392f464859f710a7bbacaaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/inspector.rs: FileTooLong \u2014 748 significant 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 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95a1de2ffe2bef5d3781c4c3e139b1ec60ae5fe1a33dc4ea8b981442047fe3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_auth_jwt::key_ring_machine::transition: FunctionTooLong \u2014 rivet_auth_jwt::key_ring_machine::transition 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":"engine/packages/auth-jwt/src/key_ring_machine/mod.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1b4410d85223cc303f919799aaebc109c9390dca174fd9ed489d7853811b70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/connection.rs: FileTooLong \u2014 741 significant 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 241 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3322169e7ff65c722784ed881c1007c8cc3954b30d8946e4bf4a71e6a5a4050d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Payloads.execute: MethodTooLong \u2014 execute runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/executor.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b908d612beae2c6fd9af30963949d1fd874fa5683d2523d15eb5f5a60f5c329"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::operator_repair::activity::describe: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::operator_repair::activity::describe runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"416728feea34b5771bffee3d42df14de36c6d187797aee4fe7cdf72bb9c164dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_error_macros::derive_struct_error: FunctionTooLong \u2014 rivet_error_macros::derive_struct_error runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32d3f0f099ce14711f5efae73d01532541ef8ca5bb44357a6ef1ad8f5fa4ecb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlite_embedded_filesystem::page_protocol::stage::execute: FunctionTooLong \u2014 sqlite_embedded_filesystem::page_protocol::stage::execute runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded-filesystem/src/page_protocol/stage.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"61efcadc16295634190523cc27348a1c375085a4fcd684c21bc5ca9f1c64257c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_envoy_client::connection::wasm::imp::single_connection: FunctionTooLong \u2014 rivet_envoy_client::connection::wasm::imp::single_connection runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/connection/wasm.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e742961f1311e3c63a641abe385334e6902ea8bdfadbc014a013482562c00317"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dump-asyncapi.main: FunctionTooLong \u2014 main runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/dump-asyncapi.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0ee86a3ec861f7f02ee6e157fcb6c1a6696330553c9bf7563962ccdf4f937b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EngineContext: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine-context/src/context.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"89605094cdae47fd475a20190a29ed5386c9bedf5e87985fb24e0c5ebe540a1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: singleton_coordinator_machine/mod.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), declaring 37 free functions. 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":"engine/packages/singleton-coordinator/src/singleton_coordinator_machine/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5343d2309ea21c5419c8f06f3919ec4d89ae293590d962ca413bf2d475b3623"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Search.replacement: MethodTooLong \u2014 replacement runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"29971d946cdcab978322f20cbd45089fc6e7bcd13d6c7d1ee5eedd9ec9abab2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::runner::run_filesystem_reads: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::runner::run_filesystem_reads runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc34cf04dc96a2a56be7fde872dce94705384337c44da90d1b57addc7f69da76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mod.db: FunctionTooLong \u2014 db runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"589bd84a3629113c031d3448c0582a62130ef6005eefd63cd88313550bbb930c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/checkpoints.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 94% of them inside a single declaration: FilesystemStore (73-1012). 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":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5bf50b6c300368dfbda609ca5256d0a5c57ee17d2f5963eb7ae4747cadcabd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Sessions: ClassTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 3 blocks, lines 47-1563. The bar is 400 significant lines; this is 177 over it, 1.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":"engine/packages/pegboard-envoy/src/sqlite/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ca8bf18b2b4b1842b70381e1ab3bedc02019284dd5ffd1b33620d90e44a7f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VolumeHost.admit_locked: MethodTooLong \u2014 admit_locked 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":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dede5a1f0c5a1ea52a28e44ae9ce4ca38e1e0f981073f5d15211f29389f25d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tunnel.rs: FileTooLong \u2014 715 significant 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 215 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54bc4c92a56b3b6b81515486c8afb6d273879c0d21a2ffaddbb7a8ee018017f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::fork_references::dispatch: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::fork_references::dispatch runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a465dbfece614390c1bd74073a5c5a388ecb6691e50c3b96e495fb265ca2a5a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mod.workflow: FunctionTooLong \u2014 workflow runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/mod.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"93853864e4000c737b667e98869bb38418ba19e21b3b2642b1bb193aca9c5eab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/envoy.rs: FileTooLong \u2014 714 significant 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 214 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/envoy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22c0bad97d6237f4f0c2cf0ced9c574b144435ce949ec827957a6ef328232fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/websocket.rs: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: RegistryDispatcher (10-706). The bar is 500 significant lines; this is 211 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28bd7dab3a4de8a787c7f3d7c9758a1018e4b0ad4742447f6d576d06af17f0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TabletCoordinatorMachine.on_event: MethodTooLong \u2014 on_event 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58525f7e6d9018ae72b187adb45119687393b754a93c5d1682e57e485836d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: executor/mod.rs: FileTooLong \u2014 708 significant 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: LogShardExecutor (2 blocks, 88-734). The bar is 500 significant lines; this is 208 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/executor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff683589ad325a1b256287eb1eaff1c569abf20a96ae3e8fe7b975ad86fd04b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/telemetry.rs: FileTooLong \u2014 708 significant 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 208 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfe743d52bfa87032e0fc5dd894e771b06b06894e87fef7004b1bb1bcc359e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogShardExecutor.write_to_disk_with_roll: MethodTooLong \u2014 write_to_disk_with_roll runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/executor/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7885acfb836aaf814433d845ace19a42d192519dafe67e9a7a206e92058e3b17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegistryDispatcher: TooManyMethods \u2014 42 methods, declared across 5 files: registry/inspector.rs (13), registry/mod.rs (12), registry/inspector_ws.rs (9), registry/http.rs (5), \u002B1 more file(s). The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e865c0239f4c3d344a686f52ba859ab13094dc8d1b935391aa212319a3073181"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ctx: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit/src/context.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffb7708838cab9bbf36b3cd8600c3d6b58157d031bb5c9c8f5855b335b61e31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_log::log_shard_machine::runner::run_io: FunctionTooLong \u2014 depot_log::log_shard_machine::runner::run_io runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/runner.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c308754e28798241db10875bbcb4d6e782bd6f8635bddc7d2fda9db4b60a17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_gateway::routes::prepare: FunctionTooLong \u2014 pegboard_gateway::routes::prepare runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d12e6ab13cfbfef5fcaab4c820d1c72ad5eee11f9d78d4f11dc1c43f636ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_api_peer::volumes::serve: FunctionTooLong \u2014 rivet_api_peer::volumes::serve 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":"engine/packages/api-peer/src/volumes/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"128b2da3a96d0425e8ce2d27e687bd0c2b189332a68dd62c6ef6c2e7918b6ea4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlite_embedded::vfs::transport::io_write: FunctionTooLong \u2014 sqlite_embedded::vfs::transport::io_write 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":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c85d694f12a66d97fc9c02629e4ec57709e979c2a27927bd9b65b86296c6607"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkflowContext: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 149 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eb397210957dce6916a102150d174b511a28534c2e910d3816cdc6a8af0e85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/poll.rs: FileTooLong \u2014 686 significant 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 33 free functions. The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd42e3cbb22eafeb36a35aabce444104a0cf83158d6495930e612d34752315f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_envoy_client::tunnel::handle_request_start: FunctionTooLong \u2014 rivet_envoy_client::tunnel::handle_request_start 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":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6279ae2b9e7bc974ed14259bb803bbd9ff395edd5862de9a8acf926cf8624c9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogShardExecutor: TooManyMethods \u2014 41 methods, declared across 4 files: executor/mod.rs (18), executor/checkpoint.rs (11), executor/recovery.rs (7), executor/spare.rs (5). The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/executor/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c96c00c1aa8407e00d11aaed666f0d578bfef29a616017b07e6f72125cdf9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_api_builder::middleware::http_logging_middleware: FunctionTooLong \u2014 rivet_api_builder::middleware::http_logging_middleware runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-builder/src/middleware.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5675e2678d53b114697ed6a164db57114227675991232fcfed6b2058997b474e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::alarms::attempt_completed: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::alarms::attempt_completed runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"029402a6cfaaaeb1ff3bc1b34e3fe18453fae6d228af9c3952ca38ea0a05832a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::groups::validate: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::groups::validate runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1486686c0cc29662c31dce1a8c4029b28008172907e52a600bf8bfb93024a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::lifecycle::promote_caught_up: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::lifecycle::promote_caught_up runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce7e0a66a2d671ae878f18d93f85f39f41ce30ad5ff06a6165459391dbfd499"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_topology::topology_machine::lease::handle_response: FunctionTooLong \u2014 rivet_topology::topology_machine::lease::handle_response runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"468d3fa1e1264590b3e6921118569eb87ebc87213f7ec2bdd559b297aed020a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/handle.rs: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: EnvoyHandle (3 blocks, 16-980). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5943de1cd9db1a1c4b54654552e10d3a7c7cfa498ac06779298ee407ff1ecc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EngineProcessManager.start_resolved: MethodTooLong \u2014 start_resolved 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":"rivetkit-rust/packages/engine-process/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4244b1e2c5ebe5a9ca2824e1f919b10c2be2781d38dbd016db2b6f39dd77893c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operator_repair/claims.rs: FileTooLong \u2014 669 significant 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 169 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ec5b28dadfa9f1e74143819387b6ed638c9ded509c1d9148a08233493dbcb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Maintainer: 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd525749995da0017288d97173235579c04f0b746fb50501084193262b82665"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/registry.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: CoreRegistry (2 blocks, 131-752). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3b2acf5c925e5a3bf116953d95ee97b375be76c75ecfaeeca70dd80e32d155"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/serverless.rs: FileTooLong \u2014 661 significant 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 161 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/serverless.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95221b5cff9a02e9f0b08cb467abc824ff5592957ac28e09b6ea3608af2aed88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Registry.handler: MethodTooLong \u2014 handler runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"df90f4bbc416a4feca8a38e5585086ff64c210dedfadfebbfcc9eaa2641b8c70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::filesystem::validate: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::filesystem::validate 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":3022}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dfa230a5fd38487e0c5683a8995c77aa46265b7a35017cf01cef47f03ae6cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utils.sendHttpRequest: FunctionTooLong \u2014 sendHttpRequest runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/utils.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdb365065a3fa84d493da4365b1eb6e6e902ec4546492cdfa94471d1f9e7f91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: volume_client_machine/runner.rs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: VolumeHandle (2 blocks, 89-670). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7a03508e722f439dc63a2d761b4f2326fecdc7d0220ff4bb4c2ceae492d23b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catch_up/mod.rs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1f97083be4b0fb61fee94565f7b82206b909b57ab497ae8071ed794ee9d333"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogShardMachine.on_event: MethodTooLong \u2014 on_event 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":"engine/packages/depot-log/src/log_shard_machine/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"303349cb69625f03b5b111f58ec0fbbbf5d30712d036a4841b885b4f6b92b4c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_engine::depot_command::tablet: FunctionTooLong \u2014 rivet_engine::depot_command::tablet 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":"engine/packages/engine/src/depot_command.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7975db613732bff402dd0acacbda305e26052f8e277223fa78a5507a471e23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard::index::reconcile_active_envoy_page: FunctionTooLong \u2014 pegboard::index::reconcile_active_envoy_page 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":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7a61835e6bdfd297192f841ef7e5c55b02752067229bacf3446ea889d2aead"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Collector.batch: MethodTooLong \u2014 batch 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":"engine/packages/topology/src/heartbeat_gc.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3fe9b172d41e7c8c16828b2e67049c24adb58310f749d6f2c875f20a023eca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TopologyStateMachine.on_event: MethodTooLong \u2014 on_event 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":"engine/packages/topology/src/topology_machine/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd47d8c0c2015af48532bc8fa26b4f79de77c725b2361ab525ea9c435d462502"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Slot: ClassTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 2 blocks, lines 120-816. The bar is 400 significant lines; this is 118 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0460692e552abf8cd1ce2a97320058d5a16832734e8aa5f6f7b84c09df42f83e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_engine::main_inner: FunctionTooLong \u2014 rivet_engine::main_inner 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":"engine/packages/engine/src/main.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbd3c49e97e1da20dbde63a83645398b180026239abdf59b686ae639f263b0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard::legacy_backfill::move_actor: FunctionTooLong \u2014 pegboard::legacy_backfill::move_actor 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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72ef6daa0237625d1673f2ab16d874eda21c45c3de5ec00de5c7d5e6d906049"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: native-database.wrapJsNativeDatabase: FunctionTooLong \u2014 wrapJsNativeDatabase runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0344bc1b4d99be1568309ec19ce0581cfe2a704e89b584301be8152e573e6f89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Filesystem.prepare_group: MethodTooLong \u2014 prepare_group 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":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf7370ba98ef03bd15ea93609a20744f3110b2aba1d301d980009648dbba6e0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RemoteManager: ClassTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 35-847. The bar is 400 significant lines; this is 111 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":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30d894e94d18f20fbbd1eb713e1ed41d0ab20979c9a76b4b03052f9296b29bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/http.rs: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"650e52e85d857029a655e2cae854f72bb87f514c3be31609e9c17ff42f6dc873"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_log::log_shard_machine::state::loaded_volume_replica::admit: FunctionTooLong \u2014 depot_log::log_shard_machine::state::loaded_volume_replica::admit 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":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"284f55e1751694ac08ce27b04a6254cf2525d58b31311bd325a5967f6e9037f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemStore.copy_materialized_page: MethodTooLong \u2014 copy_materialized_page 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":"engine/packages/depot-worker/src/filesystem/materialize.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c2e94f292539ccdb9543ec3108b53daffa1da18ce0e7e7c5faaff0728c9473"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::metrics::apply_store_delta: FunctionTooLong \u2014 depot_worker::metrics::apply_store_delta 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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"157a2f5964e7f020edaa2960cc19e056a95978245b9857ff9b0d456e30ce920c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_topology::topology_machine::lease::handle_list_storage_workers_response: FunctionTooLong \u2014 rivet_topology::topology_machine::lease::handle_list_storage_workers_response 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":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88751f69c499d72aaf5480625eabc8135fecae0cc192007517c7a3a7eb49ab9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryDispatcher.process_inspector_websocket_message: MethodTooLong \u2014 process_inspector_websocket_message 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":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector_ws.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a709b4ab86c9c7963e70d3796211f4002e332e52399b9d50032a814430c36d41"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReadSession: TooManyMethods \u2014 38 methods, declared across 2 files: filesystem/session.rs (36), filesystem/base.rs (2). 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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0393a6e045faaeaa26849b9519a83fbbf511eae239540298d65099645c72039"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ActorConnRaw: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"501df451f542a26b44dda36180919820259224493807ea0c1ecd72c93508fdd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/inspector_ws.rs: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: RegistryDispatcher (101-795). The bar is 500 significant lines; this is 133 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":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector_ws.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c037720cd685092fd2d3bde938170c81662458a7a897cb739febdb92e1ef40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Acquire.run: MethodTooLong \u2014 run runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/acquire.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2465e9d5ab994436eee6369307fcfad3eef7b09d9cca79b58cd3a8bd3a6a27ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runner.spawn_inner: MethodTooLong \u2014 spawn_inner 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":"engine/packages/state-machine-ephemeral/src/runner.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81b3b889b7df86f676761bf13deef9ccaa407710bd761d0414b89ae97ce8743"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorContext.build: MethodTooLong \u2014 build 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":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d62564bafd439de05e82044be26122a10dddd6a74e1b6ae53fa05d4056fbb95"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::deletion::activate: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::deletion::activate 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d170bb1e6b337115248af244b2c441fb08a8e2bd5c37cb41dbe1ad46bdf8861"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MigratorStateMachine.on_event: MethodTooLong \u2014 on_event 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":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1faf7d456165bd618f2262778424b1486207a82d71b0b5cc4e4103fe9307d16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/remote_manager.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: RemoteManager (2 blocks, 35-847). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb65737fa6389206ec5bbaec5dbf999d8fb96692a57c40d638a0041e63aca9d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/balancing.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/balancing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e758095d7851d4a1314b7ccee8b3a82773cbca5c58bf2448f816181ea0ce80c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View.load: MethodTooLong \u2014 load 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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c89d9b077e71a98b30caeb8e1e88837e96752e6a6be4432e5ddc3d160f272f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::forks::stored: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::forks::stored 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"490755e04edb72f726749cb566aeb79b0a0e01f4914a939543e95b09c19ba184"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_volume::volume_client_machine::recovery::read: FunctionTooLong \u2014 depot_volume::volume_client_machine::recovery::read runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"84697a7144195e485b1715de0b8db460b243b7f8b8ea88dfb9a33a649624365f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::catch_up::drive: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::catch_up::drive runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98ce6afa339b85287f02eedc6b87c834f46ebead0ff870a63323521999e031a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LoadedVolumeReplica: ClassTooLong \u2014 489 significant 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, 2 blocks, lines 55-1099. The bar is 400 significant lines; this is 89 over it, 1.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/loaded_volume_replica.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7049940b044759618ba3d7943cb56df1e02e179a491eaa419de4c529280d2376"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Slot.open_filesystem_timed: MethodTooLong \u2014 open_filesystem_timed 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":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7c7490c4a4e775bccc2dfd311dbd8d366642bab9829ef43c38f50086dbb57d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemStore.release_fork_reference_unlocked: MethodTooLong \u2014 release_fork_reference_unlocked 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":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"7883396e0ad902c114960aa5a8a9a8f0db9c28efee93cb0a0aafc3ad911e6697"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemStore.sweep_locked: MethodTooLong \u2014 sweep_locked 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":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfad3e6d21da7e1e584f47198f6df8323faa616aef62fab1809adbced9a0343"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::lifecycle::complete_load: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::lifecycle::complete_load 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ced98788a4d92f01983af613f92ac2f68a0b8efbe0f7fac7766d8c40b329c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/query.rs: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 105 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c9551232bdfc19db62d9796b6bc36d4583e2e74e6360980046a4cdbea9b2d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::unload::event_scope: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::unload::event_scope 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e928612afd4152cd0f7e5a8d2807a9587c3a1adec3fe369fcc9b91015123aa2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorContext.apply_state_deltas_inner: MethodTooLong \u2014 apply_state_deltas_inner 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":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7559a07e69a44ca5cc0bcccfb39ace68d1ae96f9eafb73cea26a44db4a1737c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/prefetcher.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: Prefetcher (2 blocks, 241-939). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/prefetcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeb99c3e6baaf317828728f691eefda53daf17ff02cceab59c5e662b2331355"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transport/v1.ts: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2039416e3d6215aedb0694247ec28c8f3b7fa4895aa768dbce0483654f96ac4e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ActorContextHandleAdapter: 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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"796ae3249179ae9091acb2ac20b6b86367e800b75f5ceb340169c0ae61fe1343"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::filesystem::applied: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::filesystem::applied runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"601eafd89adeb52c162c460f266fa8c1b902fc8fcceaa15933e6184e8e470af3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: drizzle.db.createClient: FunctionTooLong \u2014 db.createClient runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c1cf50ab1c8f9fbbf47aa106c3f3b6ce2909b2d28829f7890f50b53fc24d37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: namespace_machine/executor.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Executor (3 blocks, 25-630). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/namespace_machine/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed599f7beaedfacc91e64df0aa875ae70c06d4b1d1fdeee2345f3e22c31dd036"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_log::log_shard_machine::state::memory_batches::release_replies: FunctionTooLong \u2014 depot_log::log_shard_machine::state::memory_batches::release_replies runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"10786d36df770ed0ab0e9ffca70a29414f25e5ecc28f302b09e9fe050ac95816"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_envoy::routes::connect: FunctionTooLong \u2014 pegboard_envoy::routes::connect runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/routes.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf06429b0db404ec3c1173c108e81c644bf67fbf4e05fd1b73ffebfc8eb8d525"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorContext.take_due_schedule_dispatches: MethodTooLong \u2014 take_due_schedule_dispatches runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b351a5c565fc7dff18a0a67153dacf927a0b7a41894bf7d13ac0eea947376d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/filesystem_reads.rs: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 91 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0bfb18bb6bad0c8575d83ff1a4a26a2016eb311ab67e04f6daee80e0175f23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actors/dispatcher.ts: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 91 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/dispatcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d700bda67cbb51f621be412231720d5d4fe296b84f6b5ab3b2bfd3b6ee2cad05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/command.rs: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 90 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"decc4f48d7e4afee0ca1135c770316a3359490ee0c38ed39f6d77bb680a80dff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Filesystem.read_open_view: MethodTooLong \u2014 read_open_view 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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c44b91a41dfbff1d2c44afc36c77b44e62f08162b200c3a826d7db8a1f42ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogShardExecutor.mark_repairing: MethodTooLong \u2014 mark_repairing 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":"engine/packages/depot-log/src/log_shard_machine/executor/recovery.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"0964835d7c1f5949a39f32bd12e07f3a639ca898d2cefb6d416febbad4ccea91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: command/mod.rs: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1147b0b9bfa9d8e42281101bac129f7ef63434f57606c34ca381711a14082b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: EngineContext (368-948). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine-context/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8071c96c35b467f361e91f1b80ea8b055dc7d086015aaaf23a4149cb49bcee04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/read.rs: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: FilesystemStore (2 blocks, 21-643). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/read.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2857076bae87cd12d6fcd3b19c32e4b70bcfba9c0963545db88504cf625dba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Shard.start: MethodTooLong \u2014 start 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":"engine/packages/depot-log/src/log_shard_machine/runner.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91295aad55c1d3f781371f4e2c146acd6ede61a1f1418e75a3f7cd2b30051a8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Topology: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 4 blocks, lines 41-753. The bar is 400 significant lines; this is 67 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":"engine/packages/topology/src/topology.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cefef3f95ef6e9c91598a9633257ec8154016a660a4df3efea000abbd4c6274"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/depot.rs: FileTooLong \u2014 583 significant 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 83 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":"engine/packages/config/src/config/depot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39232c4e2d4e763133780d5ba0d16fa89baac1ab5bba6964655d724c447da5e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tablet_coordinator_machine/placement.rs: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: Search (2 blocks, 200-804). The bar is 500 significant lines; this is 82 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab07e5389e22b0da05a565463477e81220c6618cab6fbfc69024b07a60b1b45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: harness/vfs.rs: FileTooLong \u2014 580 significant 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 80 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":"engine/packages/sqlite-prefetch/src/harness/vfs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8412183a738549daa3ae02ff1b845994f85a2c80d682e114e1ac2469ef9dc90f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_fs_core::apply::apply: FunctionTooLong \u2014 depot_fs_core::apply::apply 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":"engine/packages/depot-fs-core/src/apply.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e061b6ff31dc1cd580b40fb5c1bb25cae6d79191f669af341a938bf25c4a014"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_log::log_shard_machine::state::memory_batches::install_written_to_disk: FunctionTooLong \u2014 depot_log::log_shard_machine::state::memory_batches::install_written_to_disk 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":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1b42aec7ec4f01f1d31c0349943dc8546fdc7ee1421af9259a201cdfc39b41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_volume::volume_client_machine::lifecycle::opened: FunctionTooLong \u2014 depot_volume::volume_client_machine::lifecycle::opened 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":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"be25b7ea4e5b24b6fa4042de76c39887885d7d0e9e18ab5c2dbff2f638bbb2fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilesystemStore.apply_maintainer_op: MethodTooLong \u2014 apply_maintainer_op 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":"engine/packages/depot-worker/src/filesystem/maintainer_ops.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2162802ca6bc4947ccf10afe87128391ed1e3cea18a32a364136747718c48b97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::unload::forgotten: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::unload::forgotten 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"b141e7c443e427ee3eaee7cc380f9f2869168b4355940da11114b14d7eaf6f78"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MaintainerState: ClassTooLong \u2014 460 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 3 blocks, lines 634-1274. The bar is 400 significant lines; this is 60 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddce004799928317476f729f00df1d5da0d143af36830880380aa1b28f4f276"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/depot_command.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 75 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":"engine/packages/engine/src/depot_command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2f92831d0836db5d2aa96cfe0b07d8522dd0e0720097fcc047ec5a0e82b1d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RequestExecutor.request: MethodTooLong \u2014 request 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":"engine/packages/depot-volume/src/volume_client_machine/executor/requests.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ca83f58658f9c57bdc35b158433a30ea82548a75f31ced0dbe3e265b48afa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::filesystem::drive: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::filesystem::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"380a1f6b3770b6fbe34f2651da016cbb01688f487e351ec5c313c81aae2ff502"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::stop::completed: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::stop::completed 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8d99cdff37fc62f7d8fd5a1b14c665b3fd3aa5fa25c1fcdd20a4fbb5422e19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_gateway::http_tunnel::forward: FunctionTooLong \u2014 pegboard_gateway::http_tunnel::forward 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":"engine/packages/pegboard-gateway/src/http_tunnel.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8296e3cb12472b1ecf1a34adff8261e92aa68b41c306f39a0ddd7b340be307bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/footprint.rs: FileTooLong \u2014 568 significant 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 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be0f05069f4ecda2e63d47248da1f66a5bd09a7ea0ce81bddea180346daaae6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repair/inspect.rs: FileTooLong \u2014 567 significant 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 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-peer/src/repair/inspect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e8246a71828890a2d4670d88765fa580ceee65f27c929e5fa87f34e668f1d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: volume_client_machine/pipeline.rs: FileTooLong \u2014 567 significant 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 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d21e658b5e6ad97a7dfe609527e0c5bd94e86ceeef2bbd3fcb98504eac9e3a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogShardExecutor: ClassTooLong \u2014 452 significant 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 88-734. The bar is 400 significant lines; this is 52 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":"engine/packages/depot-log/src/log_shard_machine/executor/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2600c0bda993c3915ba76c12b8a6ab31b4c98261a27a28b272acd872cf70bb40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::filesystem::alarm_bootstrap::initialize: FunctionTooLong \u2014 depot_worker::filesystem::alarm_bootstrap::initialize 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":"engine/packages/depot-worker/src/filesystem/alarm_bootstrap.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aad9ad107cc7556837e65412147683e3deb7921ba8b376cf32450a404647d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_envoy::connection::handle_ws_msg: FunctionTooLong \u2014 pegboard_envoy::connection::handle_ws_msg 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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c267ead018726e491e346ba0d0d9cc2e734106fc1a52bb5d116b24368ac129b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runner.rs: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine-durable/src/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ecf3ba6e721fe7ebf514ef6b9b5cac4ea0badb06338e170816cc24521777cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operator_repair/calls.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/calls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25da46228fa20bce4765baed1205f23f84ff24425deb704b4d351f257d953636"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_api_public_shim::routes::create_actor_inner: FunctionTooLong \u2014 rivet_api_public_shim::routes::create_actor_inner runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public-shim/src/routes.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"249e59bdcbe14508e6633fd1517b5753ca0e58caede776967077f62a3ea1a3ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VfsContext.commit_atomic_write_with_timeout: MethodTooLong \u2014 commit_atomic_write_with_timeout runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da82d93318ece423bb9b39ce750cedc2a01b481f1d4c45216e241b284d5bbaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreRegistry.serve_with_config_and_handle_observer: MethodTooLong \u2014 serve_with_config_and_handle_observer runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"463b09ab5ab84b0b526ed053103bd9594424ec1d49ab498d53c55f839a81e6e4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Search: ClassTooLong \u2014 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), 12 methods, 2 blocks, lines 200-804. The bar is 400 significant lines; this is 44 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32d589fff1495c2abf2c9a7f74ed31126f5ce5f01ede77bf069f6114a9bde73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: RivetClientWorld (251-779). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a179ad64d3ac8b7189ae5a4402fd78c63d189ecf8a7566bd15945fd3441b91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_envoy_client::tunnel::handle_tunnel_message: FunctionTooLong \u2014 rivet_envoy_client::tunnel::handle_tunnel_message 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":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c23ea4f32a06bd9169590f3f3184d6780cabfb93790db4036529d64061c4b0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mod.getOrCreateActor: FunctionTooLong \u2014 getOrCreateActor runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/framework-base/src/mod.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fa966e0e1c63e9b58b77099be713f66215ffb8a1423600efe4ca4bd2c9e180"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actor/sleep.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), about 85% of them inside a single declaration: ActorContext (119-851). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15a01b4c595bbf3700cb9811f2e2bde3c57c6355797bb8032e935536f542d65"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: State: 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), 27 methods, 3 blocks, lines 64-697. 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c263c8d725298b7dfdbc82c44883be979f71e1f62091d6b1ef27b7c97324fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/storage.rs: FileTooLong \u2014 551 significant 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 51 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":"engine/packages/depot-worker/src/services/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96569ed9fef62457342deeefb3a1c74b288fc1dee66faf10e48e8c6bfda92a19"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: VfsContext: TooManyFields \u2014 33 stored fields beside 47 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60fefb2008c0fcdffa07bd9a9598d9b5b7d1a6051a4c3157233432b37c44e6b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VolumeHost: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"82be7856d1171eb7cd0622d10fd161a4e8f7642508418efbe37fed3a3c192338"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: OperationIndex: TooManyFields \u2014 33 stored fields beside 5 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operations.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf9e349e7270186fae9f7915613c4681d058f6c4c7915a63903500e51d9f3d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: log_shard_machine/runner.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":"engine/packages/depot-log/src/log_shard_machine/runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d7fdaf217fb5c07d6604dbd3b82eaed3a370a0f83b9eebcf013e3042c1bebd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/connection.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 71% of them inside a single declaration: ActorConnectionInner (3 blocks, 105-841). 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":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8a4d7d6512e0c3324920e45a353ba0c0d38d14f4d5d642fee1957d27f3b4ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::maintainer_log::advance_member: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::maintainer_log::advance_member 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cbb2686ff44f1f88e6045505beeda6d80d9129f391aa0feb32d860e0dc0a75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard::catalog::pool_handler: FunctionTooLong \u2014 pegboard::catalog::pool_handler 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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"555a620cb9fab7305a613d1d7b393f79f8b1c1b1d90e2362773eb9870aa1927a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteDb.begin_transaction_profiled_inner: MethodTooLong \u2014 begin_transaction_profiled_inner 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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7516ee1dffcabd7bb524bd949fa8b0671272b3e3d834d73563fb7f4d98271"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DevButton.DevButton: FunctionTooLong \u2014 DevButton runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/devtools/src/components/DevButton.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"955b0e6498e05adf279db5827c7b0c90ac301b7413e7a4c1671c9afc798fd7d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_coordinator_machine::state::apply: FunctionTooLong \u2014 depot_worker::tablet_coordinator_machine::state::apply 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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"4463295ea1968e0a0335c57e4f12f04d82ef8e6bc1db99365ea439ce39108a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::forks::peer: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::forks::peer 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4a1b2ba45abaf10690ac0beace03fe176d8bb7daa4931be6f334dbdc4c44f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_envoy::kv::execute: FunctionTooLong \u2014 pegboard_envoy::kv::execute 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":"engine/packages/pegboard-envoy/src/kv.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceee234f2d4f2473ac712e011396d1802446a436f8b076681de673a407077870"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard::actor_machine::legacy_move_input: FunctionTooLong \u2014 pegboard::actor_machine::legacy_move_input 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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee69463f756fa85367b6506f963354c550072b70cbda034c2d3b3dba6143654"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Prefetcher: ClassTooLong \u2014 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 241-939. The bar is 400 significant lines; this is 34 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/prefetcher.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6134e8847400538c2460e5af438dd87ca98ce62767423e468a9de1cfe57b7aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RegistryDispatcher: ClassTooLong \u2014 433 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 42 methods, 4 blocks, lines 204-1465. The bar is 400 significant lines; this is 33 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a706d4d09f8d79cc0ea68a4e067b373009863f632b44019ce3772c3e0e6d595d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryDispatcher.start_actor: MethodTooLong \u2014 start_actor 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":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"224ab70a73c94a1dcbf3bfda27a8c76f7df5e1db47adc146e5ecd59dbef17cac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivetkit::start::handle_actor_event: FunctionTooLong \u2014 rivetkit::start::handle_actor_event 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":"rivetkit-rust/packages/rivetkit/src/start.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"615b2ba2c066272701edbeb90fe011b54071b3a9239a65f1d20513c415c10c04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rules.rs: FileTooLong \u2014 538 significant 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 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfcec3d96409ae9460715b3df124fe2f152180d2e0dc534fb3bd510babdb999"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_api_public::actors::list::list_inner: FunctionTooLong \u2014 rivet_api_public::actors::list::list_inner runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/actors/list.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b873fb0239e1e6bc1c48c47aa322e047ca9c075333b18fc539fabb6815c60964"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ws-proxy.createWebSocketProxy: FunctionTooLong \u2014 createWebSocketProxy runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/ws-proxy.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a17e1597a976059fa56307b52b9b3c269f63ae983f95b27b6f181f787fad2a3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeDatabaseHandle: 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":"engine/packages/sqlite-embedded/src/database.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9cd6292edef66a8aa68cbb72250a7b25f59b4b613c53784e7c7038aa334e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: sqlite_prefetch::harness::workloads: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; 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":"engine/packages/sqlite-prefetch/src/harness/workloads.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b92775a646d4452d0833072bc3c47e9c3a6b81d0f90de5be1cccceadcda42b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Topology: 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":"engine/packages/topology/src/topology.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1705e31de70011b07830873741ad4751f181f1e5acfc673cb777e8de45f0f09"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConnHandle: 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":"rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b2e4e7d70fd3f9d25b3892e810ab213a88485f17903f631fba869ade26389e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LogShardConfig: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/types.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2159cb3b12e1e156056921192ea71de89ad3dbaa9f4e615e3d65f23123b18a2d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: JsActorConfig: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"43884e748cf1d5adf7fcfcb51516cdcc392c8f9ccfc39de3a917e7762495d12b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/stop.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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"366511f24c4a8ef563954e7958fc51fb4dde8b4dab82ea828907daef0fe113b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::deletion::drive: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::deletion::drive runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d888eae374ffe6fd5fc9897489eb8bf1d3fdd37317f268586952d1f6cc9c3d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_flush: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_flush runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57cd7b374a49584d3df819cdde0ad4518518f73d18ae8f6c2b02d9f626497b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::revoke_lifetime: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::revoke_lifetime runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df32565b8d9e3e2314a7fc82e808da9f300257b928723efed684a992c2751d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VfsContext.flush_dirty_pages_with_timeout: MethodTooLong \u2014 flush_dirty_pages_with_timeout runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"c110ed1aa292b8fe082decd00cedadd8bec90e89d4b8281552f70a77f5d1741c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VolumeClientState.initialize: MethodTooLong \u2014 initialize 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":"engine/packages/depot-volume/src/volume_client_machine/state.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9440783ec6003adafcdcd6081fcac20eeaa05b5b60b3cfa1fbc4299890946c8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard_v2_migrator::recover::recover: FunctionTooLong \u2014 pegboard_v2_migrator::recover::recover 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":"engine/packages/pegboard-v2-migrator/src/recover.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9266602d8dc9302c09a11ee9464a81f0275e3e2d0af0075482b3dfd2e3b8961c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryDispatcher.handle_queue_fetch: MethodTooLong \u2014 handle_queue_fetch 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":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f3759b2991c03cdb2ca1b6dd80656a54b83b0f79351da4b913b112a9135bda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/checkpoints.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ae23dccade7ad300b5cc4256bf6637a4512149c56e8c7736796524e8dd2b67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::alarms::drive: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::alarms::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43e07ed623590633b2684ebc3ec55b0fcf7f094f24984f7888ff6ae52401bc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::fork_references::completed: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::fork_references::completed 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a2328b3996848dcd77c6d2411fdc14de4d1aadf9b6ab32c40bbb71d24f8bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pegboard::index::prepare_active_envoy_index: FunctionTooLong \u2014 pegboard::index::prepare_active_envoy_index 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":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"01312a3d76074de3620c3b4802b161e511cb47617d705e1793a7c6c623745f52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivetkit_napi::napi_actor_events::run_preamble: FunctionTooLong \u2014 rivetkit_napi::napi_actor_events::run_preamble 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":"rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04cd42ac8cff27d102e3185c6278293b969ceddd8352feefd3d0aa3bda9a197"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystem/remote.rs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 18 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":"engine/packages/depot-client/src/filesystem/remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89131fd9ac56d4f8e8e869628f817fb97d08addae4e9e2ad8b7274458798909"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ActorObservable: 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":"rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a5887961b29fb46593c9698e371fc773e6ddf503e921e8e121f531dc40f5df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MaintainerExecutor: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fab40fe4433c429838ad1e177fe342a1a247f7dc4ec73c20139509cfa0dcda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlite_prefetch::driver::read: FunctionTooLong \u2014 sqlite_prefetch::driver::read 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":"engine/packages/sqlite-prefetch/src/driver.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f77561e0c751a5faad64698fa972366b4f590c9e68af0eaa1c8318861cdcad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDraggable.useDraggable: FunctionTooLong \u2014 useDraggable runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/devtools/src/hooks/useDraggable.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cd9645d9dca06e2565f10e26ff3d7a71701947712d758ba55aed365cfaa77d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CoreRegistry: ClassTooLong \u2014 411 significant 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 131-752. The bar is 400 significant lines; this is 11 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":"rivetkit-typescript/packages/rivetkit-napi/src/registry.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9bc60b228ef450c7d670336c69587f554e367d9a8434b0225a505bac7ae8b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: production/slatedb.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: ProductionSlateDbFactory (3 blocks, 36-694). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/backends/production/slatedb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d21fc2a6c19cd1b2e8b0cd62567459356c034ba78a20afd777fe1d0f66e511"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActorObservable: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 8 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":"rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d55ec8479f6d6ead446f06a4ba5e0481772de5fd653a1ea366d2a86fbef592"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VolumeClientMachine.on_event: MethodTooLong \u2014 on_event 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":"engine/packages/depot-volume/src/volume_client_machine/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"530bf9c9a2de4e274f74670072e2ca30ead0c338d9ebe5efc492a82593f8ef59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadSession.chunk_versions: MethodTooLong \u2014 chunk_versions 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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc75448a6d062f35cdf79edbae589d49fb1dee66b058011ce72ae5d8f20d5f2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::checkpoints::drive: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::checkpoints::drive 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22038923bdc94dd49904fad59cf3deddb09fe1e11b5b4feaabc1d908bf703ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rivet_service_manager::start: FunctionTooLong \u2014 rivet_service_manager::start 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":"engine/packages/service-manager/src/lib.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b361c8c4fcd50f33d05741b9f9e683624bb6789151414cfe59bc8b41fb72dbab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorConnRaw.#handleOnMessage: MethodTooLong \u2014 #handleOnMessage runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a2559b23c21f3855404232ce3ce8df9ea94816d91555b0b11b718411d30303"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActorConnRaw.#handleOnClose: MethodTooLong \u2014 #handleOnClose runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a962c305f12ad89d2b0da1207622b84e40f4208110ebe9f8d5a506a4be6529"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: migrator_machine/executor.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":"engine/packages/pegboard-v2-migrator/src/migrator_machine/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb3254e65e73e9cd2e985d4870a04dc7d0a47ee596ad4a1d417273ef7f5c4a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: volume_client_machine/state.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 64% of them inside a single declaration: VolumeClientState (2 blocks, 340-864). 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":"engine/packages/depot-volume/src/volume_client_machine/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd50dc2a577fbab2165c3f62f5e2807d3dfc716b9bf7c9a3972e3baa925ea055"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: maintainer_log/replay.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), declaring 35 free functions. The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/replay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce4f62a0300a15808592f0f2eb4e0c8413c2f8c6d471dc86657a1411d943475"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transaction.scan: MethodTooLong \u2014 scan 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":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b340011179ab04666a255c45400c6c953c047947a24d57e9940d5a2c2d048b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_apply: FunctionTooLong \u2014 depot_worker::tablet_maintainer_machine::state::filesystem::dispatch_apply 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4de0fabb8655589e84d69d0188752d9c7b0f3cf7f79221bf2c104b90414e634"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqlite_embedded::vfs::transport::io_read: FunctionTooLong \u2014 sqlite_embedded::vfs::transport::io_read 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":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":3055}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1055217e9d3d3de0d078d3e909b9baae7008b6a8c77bd0a132e0dec0f0e0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 25 shared lines): rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:214-241 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:272-302 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:304-334 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:336-371 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:373-409 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:412-439 \u2014 These 6 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9b468702d170311838cacc28aa3ff2237113219436d796d85279ef29dfbd70"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 27 shared lines): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:626-668 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:684-737 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:753-801 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:817-860 \u2014 These 4 members are variants of one another: a block of 27 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cdc2600920cc70fa7267fe02648b57a9b9269b2659648bcd0873f39d894496"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (90 shared lines): engine/packages/sqlite-embedded/src/vfs/transport.rs:2063-2201 | engine/packages/sqlite-embedded/src/vfs/transport.rs:2215-2356 \u2014 These two members are variants of one another: 90 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fc54472d8d17317ab258fb255581a70172658b3c205075169bb3ec5818f417"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (71 shared lines): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:197-312 | rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:319-456 \u2014 These two members are variants of one another: 71 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":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"97635eddef4bb3802db583d620a3dff2823cffade6c910312a069e612e411199"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): engine/sdks/rust/envoy-client/src/handle.rs:905-939 | engine/sdks/rust/envoy-client/src/handle.rs:945-979 \u2014 These two members are variants of one another: 31 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb41691f6d6465afed59c82aff587fc2c42330b3b02a3b89b07d53dcc0a1db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs:176-187 | engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs:304-314 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f2d14008f198bd7c2b07ca42154b20828632c52c3234b25acbfbb3a11533c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/packages/error-macros/src/lib.rs:507-539 | engine/packages/error-macros/src/lib.rs:549-573 \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":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f7e24f3bbc066f0905fa8f1d00bb1060f0cfa3d13875034bba5dfbced0e796"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): rivetkit-rust/packages/actor-persist/src/versioned.rs:71-91 | rivetkit-rust/packages/actor-persist/src/versioned.rs:437-449 | rivetkit-rust/packages/client-protocol/src/versioned.rs:47-67 | rivetkit-rust/packages/client-protocol/src/versioned.rs:454-474 | rivetkit-rust/packages/client-protocol/src/versioned.rs:570-582 | rivetkit-rust/packages/client-protocol/src/versioned.rs:681-701 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:57-85 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:366-394 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/actor-persist/src/versioned.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cd80ec7deea15be63a02c8713759075200ad1eadedd87a4cbf138d586f5cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:916-929 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:915-928 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:938-951 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:976-989 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:965-978 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:965-978 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"97005c76a1e09617e84eb9abd8e1191311f11399ada0174388e326489184272a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rivetkit-rust/packages/actor-persist/src/versioned.rs:52-65 | rivetkit-rust/packages/client-protocol/src/versioned.rs:31-41 | rivetkit-rust/packages/client-protocol/src/versioned.rs:437-608 | rivetkit-rust/packages/client-protocol/src/versioned.rs:665-675 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:39-51 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:348-360 \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":"rivetkit-rust/packages/actor-persist/src/versioned.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"367746e34efb88f1f2021b68b7ad4f98c7a6a2966c77fb6f05e60c6e95add956"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/packages/depot-fs-core/src/keys/slatedb.rs:878-905 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1105-1157 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1189-1222 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1227-1249 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1320-1348 \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":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ccdaaaa7c97eb77be36d87a264046122a636c6968b4842bf974dde637b6a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:129-149 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:175-198 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:201-224 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:227-255 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:258-287 \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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48072fb702d83ccae2293ccfa0fad9148671569459331705176b948fdd33afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/packages/depot-volume/src/volume_client_machine/runner.rs:458-472 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:606-625 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:630-646 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:650-669 \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":"engine/packages/depot-volume/src/volume_client_machine/runner.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"463184a3270e3ab47c1d9ab69f47a1da348b9ee888c2b9aea75cc854014d2c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/packages/sqlite-embedded/src/pager_cache.rs:575-599 | engine/packages/sqlite-embedded/src/pager_cache.rs:606-636 | engine/packages/sqlite-embedded/src/pager_cache.rs:638-664 | engine/packages/sqlite-embedded/src/pager_cache.rs:688-713 \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":"engine/packages/sqlite-embedded/src/pager_cache.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ed9a8b2fd9dfed0ad97cb95b0b694a07051baf3a05dec356a7f882b32a85ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/packages/sqlite-embedded/src/query.rs:247-308 | engine/packages/sqlite-embedded/src/query.rs:316-391 | engine/packages/sqlite-embedded/src/query.rs:399-470 | engine/packages/sqlite-embedded/src/query.rs:477-560 \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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05a72003b2ca6392c1c77e52ef740d9e8a10377284104c91833483197d18b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/sdks/rust/envoy-client/src/tunnel.rs:365-389 | engine/sdks/rust/envoy-client/src/tunnel.rs:395-416 | engine/sdks/rust/envoy-client/src/tunnel.rs:622-670 | engine/sdks/rust/envoy-client/src/tunnel.rs:677-714 \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":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c8365d9679afc6c1104effe142975e2f64b7caacb3fe1cc993891968fd728f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:645-660 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:662-678 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:680-697 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:699-717 \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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70920a654a4021c4c544bed22606317a3aa003114d0bffaabba3b612c8141ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (225 corresponding lines): engine/packages/error-macros/src/lib.rs:17-241 | engine/packages/error-macros/src/lib.rs:243-503 \u2014 These two members are one piece of code written twice and then edited apart: 225 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c256aa86d3b284ecb345ec65b8cf9fef384253680a58531e1e5289ac898e91c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 55\u002B corresponding lines): rivetkit-rust/packages/inspector-protocol/src/versioned.rs:500-556 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:558-612 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:614-673 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:675-729 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 55 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":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40981ac401361708b08beeff978c6a956f15d4192246f0db2ca017686c6a572"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): engine/packages/auth-jwt/src/persistence.rs:98-171 | engine/packages/auth-jwt/src/persistence.rs:177-260 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/persistence.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f84190eda47bc3f321765d6f0484a88829088a4e5ec0479341c27ff3b4174b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:3335-3395 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:3399-3458 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":3335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3815cb435c4d9e6ea0a4ac358fd83814f389a32d082fc607525829f5489a38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:1125-1170 | rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:86-134 \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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c439aa7a46e1bfa3d7f5c28df1f854f7ad720d99b00a295832a431bc7c89b555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rivetkit-rust/packages/inspector-protocol/src/versioned.rs:458-498 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:776-814 \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":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b1a32301f246f8b856145b233d18f66871c6fe33cbd77d2fbae9588c71d4e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): engine/packages/auth-jwt/src/rotation.rs:147-211 | engine/packages/pegboard-v2-migrator/src/requests.rs:174-225 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/rotation.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f234e9a90e19084e97fe15db07533f337c31364e6560e5f9099bef02de53e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): rivetkit-python/client/src/simple/async/handle.rs:120-174 | rivetkit-python/client/src/simple/sync/handle.rs:110-160 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/simple/async/handle.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaef2f20a4b418d8b6ac6d53142835eebe596e39dbdd5ebfabd61a0c42ddf5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:687-721 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:743-780 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfc8c88d238f96e10da72dc577ff77af83e3644de60d0d89a728c0677f00660"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): engine/packages/pegboard/src/catalog.rs:1016-1054 | engine/packages/pegboard/src/catalog.rs:1237-1273 \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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"828f0b0fd4ee7274da8addd7b5b3abb518377076e6a118336d2050e2d5feb4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): engine/packages/engine/src/epoxy_services.rs:39-87 | engine/packages/pegboard-v2-migrator/src/services/migrator.rs:51-91 \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":"engine/packages/engine/src/epoxy_services.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5c47f3ceeab9c78868cc9edf6f2843fedbf2b36ba62aaeb915f52b0272ab34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): engine/packages/runtime/src/lib.rs:206-247 | rivetkit-rust/packages/rivetkit-core/src/tokio_runtime_metrics.rs:138-185 \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":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"29325021a55d498933316409e1ad3ece74cef8a16a62fc731cb4840b4680bdcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): rivetkit-rust/packages/client/src/remote_manager.rs:726-774 | rivetkit-rust/packages/client/src/remote_manager.rs:782-818 \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":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"022255b9d1ae20d65baf8e47ea4f024d9b079c609e0010e71a7b311e9d2244ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/cold.rs:312-343 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs:1454-1492 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/cold.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad0d73255112ca48da8217c10bb410662224ae181e19a0af22433a6115859f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): rivetkit-rust/packages/client/src/remote_manager.rs:327-384 | rivetkit-rust/packages/client/src/remote_manager.rs:392-434 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"00df44f7212a9b667128925099bb6f51f08e55563fd493b796931d0b2836f0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): engine/sdks/rust/envoy-client/src/stringify.rs:28-93 | engine/sdks/rust/envoy-client/src/stringify.rs:95-158 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/stringify.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0110a6ef7a42af0cad887e9c043ccd18e6ab3b392fdcc2f14adeb302018dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): engine/packages/sqlite-embedded/src/query.rs:642-676 | engine/packages/sqlite-embedded/src/query.rs:682-727 \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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a8bca43f753bd7761b9deabe3ec9b0b0a572bd022e0e67068191f2aa38dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rivetkit-rust/packages/inspector-protocol/src/versioned.rs:135-166 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:266-295 \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":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1323edb944a6381e8f4618f6596d6dccbf8bdae57f8138628e7637fc29ed13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): rivetkit-rust/packages/actor-persist/src/versioned.rs:147-195 | rivetkit-rust/packages/actor-persist/src/versioned.rs:295-341 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/actor-persist/src/versioned.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6759314114b36885046f2e2d2afe928262615a798b21ece122c930d5e5644570"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): engine/packages/api-public/src/actors/create.rs:57-99 | engine/packages/api-public/src/actors/get_or_create.rs:65-107 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/actors/create.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"debd37e1c6dc5ef56e0c5f5ff029315d5b9398794ad45f4fb6c604cb0fdb6677"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rivetkit-rust/packages/client/src/handle.rs:88-126 | rivetkit-rust/packages/client/src/handle.rs:154-192 \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":"rivetkit-rust/packages/client/src/handle.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ceb0a786cb7f0edb3c1d5a47742ce81d0e4ee1a6f4c694b786c05b2b0a1e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:589-622 | rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:666-709 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfcd7144cdcad762d4afa0114e6b9f6ddf1bce8a160fd7268ea2549b072ee3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): engine/packages/pegboard/src/namespace_machine/executor.rs:246-307 | engine/packages/pegboard/src/namespace_machine/executor.rs:316-354 \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":"engine/packages/pegboard/src/namespace_machine/executor.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99ab371194b1c7910a67c3929895890b19e6da725c42aa8db5e393c023ac190"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:306-345 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:354-395 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45e5ed41861fd5d5f9d73976efcd8524db34a3bcf8059c99e809518a3623126"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:487-528 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs:715-756 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3c4e426df3d818e9c34891d2c867adcfab9522197711093c9db14804a97198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:376-412 | rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:418-465 | rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:471-516 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c0e73d5e7aba5c0fbdb98b2d6a365708ef56f4f5aac16e07bdc2d7cce21736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): engine/packages/engine/src/depot_peer.rs:16-61 | engine/packages/engine/src/depot_peer.rs:80-123 \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":"engine/packages/engine/src/depot_peer.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"be65ec9dd7230fc3f329384c919ddb582520f46f90718c373e649d6229d32e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): engine/packages/pegboard/src/index.rs:1231-1264 | engine/packages/pegboard/src/index.rs:1273-1308 \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":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5db5fa5548654495e83762d2538fd7772fe72f97cd4e79c15acdaebf1ff8732"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rivetkit-rust/packages/inspector-protocol/src/versioned.rs:230-264 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:1246-1264 \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":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2175554bf3cdc80a957cf920fdfdd5da710cc54adf70097f829944c40b07a7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:81-121 | rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:132-163 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cd0f9bc42d32d0609d38472e120aa8e078e9b42db6951a43326f521cf5a061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/lib.rs:77-111 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:3344-3377 \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":"rivetkit-typescript/packages/rivetkit-napi/src/lib.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5444a9715c647a7620f5592040c719cb0fc986274898fe7b113bf81eaff5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): engine/packages/pegboard/src/actor_machine/mod.rs:2190-2239 | engine/packages/pegboard/src/actor_machine/mod.rs:2247-2292 \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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c64995ea5f949f83d84f99a68bb0d9ad05f53b3731f4f036d0f4cc14327671c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:1040-1071 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:3259-3289 \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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa00caf918d7b5e5e84691c6d5a86e38e1a9929ac0640e5260d2b16e09d98c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:2457-2495 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:2596-2636 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":2457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc2fa66b33eb1d063194487762869532aa62eed9656e56331dfdd0663e5f5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 31\u002B corresponding lines): rivetkit-rust/packages/client-protocol/src/versioned.rs:76-106 | rivetkit-rust/packages/client-protocol/src/versioned.rs:115-146 | rivetkit-rust/packages/client-protocol/src/versioned.rs:148-178 | rivetkit-rust/packages/client-protocol/src/versioned.rs:187-218 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 31 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":"rivetkit-rust/packages/client-protocol/src/versioned.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9233d4e6540f00ab3f1b61cc99b156e1b8d885cb7eafef115af678d17d8681b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/packages/pegboard-envoy/src/sqlite/routing.rs:10-28 | engine/packages/pegboard-envoy/src/sqlite/routing.rs:31-49 \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":"engine/packages/pegboard-envoy/src/sqlite/routing.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca4e8989f85e9778223c5f455310a765a4e9c34161e59a4d2d043124c49eb7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:492-525 | rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:534-568 \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":"rivetkit-typescript/packages/rivetkit-napi/src/registry.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c24729def9965fc1694772cec9e8e0ffcb2b1f74941125bc72b07ad401dfa52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): engine/packages/depot-worker/src/command/mod.rs:859-884 | engine/packages/depot-worker/src/command/mod.rs:897-926 \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":"engine/packages/depot-worker/src/command/mod.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb9086886975aa46427a5021dbae9841c2f3e2405b255a9bdac5feca132b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): engine/sdks/rust/envoy-client/src/sqlite.rs:545-578 | engine/sdks/rust/envoy-client/src/sqlite.rs:585-615 \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":"engine/sdks/rust/envoy-client/src/sqlite.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f0303be3b2f842f1b4083c4d277a9cb1cd88b7393cd24c4a22fb2669065f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): rivetkit-rust/packages/client/src/remote_manager.rs:255-286 | rivetkit-rust/packages/client/src/remote_manager.rs:288-319 \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":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2a7e5e0485e1953d512082528d4e1b83bd267a95a7cdef2cf0943af2d5a43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rivetkit-swift/Sources/RivetKitClient/RemoteManager.swift:109-132 | rivetkit-swift/Sources/RivetKitClient/RemoteManager.swift:134-157 \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":"rivetkit-swift/Sources/RivetKitClient/RemoteManager.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2155d587bd97d1367d131de61f8ce283c925dbcde74dcbc370ca7078b50e2925"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): engine/packages/topology/src/topology_machine/lease.rs:969-1005 | engine/packages/topology/src/topology_machine/lease.rs:1013-1046 \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":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"815cacdfcecb7b690127f307a3c381e3f2c911919fe2f23a50cae99d4cfd62e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): engine/packages/depot-worker/src/stop_requests.rs:149-177 | engine/packages/depot-worker/src/stop_requests.rs:218-256 \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":"engine/packages/depot-worker/src/stop_requests.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0815c55643d5998b27fdadb094e5b8ee0edde916f0f18b7ef5e745ed67a33ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): engine/packages/depot-worker/src/tablet_supervisor.rs:2137-2162 | engine/packages/depot-worker/src/tablet_supervisor.rs:2176-2207 \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":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aea00ef2cc902aad069ceb57fa47ca64b4e200db6cf610ee6743aa71d4a20e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:57-80 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair_claims.rs:69-86 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad0f0831c680ac15e84ad0d79e3602759364afc7f9837926b4538956ce51a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1348-1370 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:3609-3638 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5302b2be9f14059d71e23bf47e1a488079cc429bb04a64db6abfa518916597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): engine/packages/depot-worker/src/command/groups.rs:198-228 | engine/packages/depot-worker/src/command/groups.rs:291-322 \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":"engine/packages/depot-worker/src/command/groups.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dd53187113695a471d5ce4a9649a470503d62c383d51154afc5e2a349063e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): engine/packages/state-machine-durable/src/runner.rs:523-549 | engine/packages/state-machine-durable/src/runner.rs:560-586 \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":"engine/packages/state-machine-durable/src/runner.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c529b5e93cfd77fcb915496abae5ae15c55718d739c0e7f4eca39b05cd0ddd77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): engine/sdks/rust/envoy-client/src/connection/wasm.rs:344-360 | engine/sdks/rust/envoy-client/src/utils.rs:114-130 | rivetkit-rust/packages/rivetkit-core/src/lib.rs:66-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"engine/sdks/rust/envoy-client/src/connection/wasm.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16e3e9fe54f5150b55370505a0be884e3760d9a8427228ad3b5a033c66a999b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): engine/packages/depot-fs-core/src/txn.rs:365-391 | engine/packages/depot-fs-core/src/txn.rs:395-419 \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":"engine/packages/depot-fs-core/src/txn.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"58201f68c9ade977397ea506cd5e41f366c68214a2b82b4c124572fc14beb52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): engine/packages/pegboard/src/index.rs:1585-1616 | engine/packages/pegboard/src/index.rs:1624-1652 \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":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f3a33a04f1dfbe2dfa515e1010d462a9929252986d6b0cda4da58c3d8e10b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rivetkit-rust/packages/engine-process/src/lib.rs:858-881 | rivetkit-rust/packages/engine-process/src/lib.rs:883-910 \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":"rivetkit-rust/packages/engine-process/src/lib.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99a8415b9dc69c4ef7f25bb4d57109190af8cfcb22013acf4efdd122ba9e80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:618-639 | rivetkit-rust/packages/shared-types/src/endpoint.rs:120-141 \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":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a61e9fc07b969edbef618f78f8c9be64167ef2f0b3d95d79d6b25a0da06aede"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rivetkit-rust/packages/rivetkit/src/start.rs:122-150 | rivetkit-rust/packages/rivetkit/src/start.rs:152-183 \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":"rivetkit-rust/packages/rivetkit/src/start.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a1162ee50d6dc3eba0831e8b45484f08f6247f0825fdd016fff1f43b92206"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs:414-441 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs:524-551 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"553862017dd31ae077b3f0349206c606e7eaf18f5bea95863e09032a70fe54d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): engine/packages/depot-volume/src/volume_client_machine/requests.rs:519-541 | engine/packages/depot-volume/src/volume_client_machine/requests.rs:544-575 \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":"engine/packages/depot-volume/src/volume_client_machine/requests.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e57faff505d4606b3f528e54157f99bc782a9975260ffa38dae4ee4cb8e1895"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs:1483-1515 | engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs:1517-1561 \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":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaf3e69e9c44a2ee0a932bbb132bde92337595212e8c00d471b27a6a5d321f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:281-310 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:325-350 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f482c076edf56d0c1dc499896529ebe8f5c298d28916f55d2fa7d7320d6f2975"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): engine/packages/api-public/src/actors/delete.rs:45-69 | engine/packages/api-public/src/actors/kv_get.rs:41-69 | engine/packages/api-public/src/actors/reschedule.rs:47-72 | engine/packages/api-public/src/actors/sleep.rs:47-71 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/actors/delete.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7bcf43ebac47f7c3a9c52cd15bd4c1988ae40a74f3dd3b559b3746db7e2687"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/logged_ops.rs:32-47 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/replay.rs:173-186 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/logged_ops.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf96f1d754bd771ae971f9f76903000443731ccdbc7c80e0271cedb35f8dc33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:897-914 | rivetkit-typescript/packages/rivetkit-napi/src/http.rs:222-238 \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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90a1564b52c4c01f55b4abd2d713008e52da32988c9a1b6134c775b9f985cb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/depot-client/src/filesystem/client.rs:2301-2314 | engine/packages/depot-client/src/filesystem/client.rs:2322-2342 \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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"18efd28bd0d941f14dd5bfbbecd6cf804dfaf18fe08a729b5cb1b14b0988e6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rivetkit-python/client/src/simple/async/handle.rs:84-112 | rivetkit-python/client/src/simple/sync/handle.rs:75-102 \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":"rivetkit-python/client/src/simple/async/handle.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd413c62f8308574fb0a40036e59494b41761d2591609ab412d91d74f6878265"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:637-655 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:657-675 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b72efa66c683f0f1893073edcebbc23e7d370833c416d2f3222e650924fecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/packages/cli/src/cloud.rs:523-549 | engine/packages/cli/src/target.rs:243-261 \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":"engine/packages/cli/src/cloud.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"867ab5983bcd258fa01a968d3d5f2a29d380dfefc140f01846ab2002e7b02ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:58-79 | rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:333-361 | rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:516-537 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9f1845f07c5399b63286206ef6401074c3ec9dee249f54cf9ec33e601986d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/depot-client/src/filesystem/txn.rs:380-393 | engine/packages/depot-client/src/filesystem/txn.rs:394-412 \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":"engine/packages/depot-client/src/filesystem/txn.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d64620a09eae26ee2f08760640b2e5417a2fde81a048e8a66216d6e41fb178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/packages/pegboard-envoy/src/connection.rs:2488-2504 | engine/packages/pegboard-envoy/src/connection.rs:2507-2523 \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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d112dcf1985b9beb65820257bab60c6047e63d845803da178cd8c1c1568d089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rivetkit-python/client/src/events/sync/handle.rs:25-45 | rivetkit-python/client/src/simple/sync/handle.rs:45-70 \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":"rivetkit-python/client/src/events/sync/handle.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fd9556790b99f718adc4dd3e64d9737edcf84bd20dde7be9b25aeb55943eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rivetkit-rust/packages/client/src/protocol/codec.rs:355-374 | rivetkit-rust/packages/rivetkit-core/src/registry/actor_connect.rs:264-287 \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":"rivetkit-rust/packages/client/src/protocol/codec.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd80c649f09970f1b5b946663ae22f82ac4844d7d073ebe8781491ec481df88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): engine/packages/auth-jwt/src/rotation.rs:60-87 | engine/packages/pegboard-v2-migrator/src/requests.rs:93-125 \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":"engine/packages/auth-jwt/src/rotation.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d710aa88356b8be6d500125edb15c24bf8508b5536d6dc0cca0c6704e82d77a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:205-224 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:228-247 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6416846f2e18ca893b1b4c15b63b6fb9633f7cb75908887fd2dd670bf55c2364"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs:191-208 | rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs:294-312 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1b0edc272440d4544a65846b88c49322771bc55f221f5dca2779881a83596b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): engine/packages/engine/src/depot_peer.rs:158-179 | engine/packages/engine/src/depot_peer.rs:188-209 \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":"engine/packages/engine/src/depot_peer.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f106c4731e70bb2b52d21cd4fd8860e40c74c79be1b225835cab0ac578cd39b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:402-416 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:426-439 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd133429be5d283e3628729cb90fa46cc4f28801385a8e9317958473a796e944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rivetkit-rust/packages/actor-persist/src/versioned.rs:457-479 | rivetkit-rust/packages/actor-persist/src/versioned.rs:481-503 \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":"rivetkit-rust/packages/actor-persist/src/versioned.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b40d6ab4aad805a7d9ec90f960e7c27fd814d1e1ba888fd4b682f4f1572df18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:170-183 | rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:185-198 \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":"rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2503e71fb51ddc89cc54c8d24c8998bcf4508b6ea513548c7113bb78e8873bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/env/src/backends/production/external_http.rs:122-135 | engine/packages/env/src/backends/production/external_http.rs:138-150 \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":"engine/packages/env/src/backends/production/external_http.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1fe23680e8d3dcab1af45a480afdcc0ebccf25fba938719806220ee06552e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/packages/depot-volume/src/ups/client.rs:86-103 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:263-280 \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":"engine/packages/depot-volume/src/ups/client.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c67884507e4a20bb5a7def77e25abaf4843ff61c0c1fe7e9fff6b135a0e41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): engine/packages/api-public/src/namespaces.rs:32-59 | engine/packages/api-public/src/namespaces.rs:83-106 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/namespaces.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"683b4d81aab135cfdf9135c07bb31fcbb49072cb4e566afa85ae940b62cd573f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/packages/sqlite-embedded/src/page_buffer.rs:384-401 | engine/packages/sqlite-embedded/src/page_buffer.rs:414-429 \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":"engine/packages/sqlite-embedded/src/page_buffer.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9730726c08f6b11bd6ab0081adb7d95661d7500b86ff5af60c05b1579eb7a090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): rivetkit-rust/packages/rivetkit-core/src/registry/envoy_callbacks.rs:260-286 | rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:906-936 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:145-171 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/envoy_callbacks.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aa58a5fa46869ebd675d5899fb69928a4443fa8ffb75955d2d9c90a32ca2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/context.rs:1876-1904 | rivetkit-rust/packages/rivetkit-core/src/actor/context.rs:1928-1956 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"8025b9ddab56b43dc82a7cf7013c011672bcc03f77a934cdb7975db7b14adcf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/packages/depot-volume/src/volume_client_machine/pipeline.rs:751-772 | engine/packages/depot-volume/src/volume_client_machine/repair.rs:254-270 \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":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"484ed1f2740673572160d3591cbf0eee2ba6301c04bbe3ab1f7c8cc190b5a35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): engine/packages/universalpubsub/src/pubsub/stream/packet.rs:88-113 | engine/packages/universalpubsub/src/pubsub/stream/packet.rs:131-153 \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":"engine/packages/universalpubsub/src/pubsub/stream/packet.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32d6b2658b41b77ab95cc29d6cfc61d94f1b39e7dae5a9e4df5dfbf667bc4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/sqlite-prefetch/src/recency.rs:150-160 | engine/packages/sqlite-prefetch/src/recency.rs:208-218 \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":"engine/packages/sqlite-prefetch/src/recency.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d610bda02dbf54d080ac8aa3a3cf8a4e79eca4bd98abc41d5b01fab6dae5d762"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:225-245 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:467-489 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7310dc7913ffadb45b2634a95b91e20d11edfc521bc120a756b480404523d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/packages/depot-worker/src/filesystem/forks.rs:206-221 | engine/packages/depot-worker/src/filesystem/forks.rs:230-245 \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":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7d9c699f1ca1a5026081e55f247d4c3ceba0659ac3ee7b1ba66130177ba0b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:247-272 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:274-296 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"1095deb2d42ba3a68c896485ad9280d72b04ebd86e64316714fafd4858dcc2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rivetkit-rust/packages/shared-types/src/actor_key/mod.rs:36-57 | rivetkit-rust/packages/shared-types/src/actor_key/slash.rs:16-41 \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":"rivetkit-rust/packages/shared-types/src/actor_key/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"773ddaf1d32aa83eaf9bf3c545f54226196a31d2099124e33253ce1825b5c30c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/cli/src/cloud.rs:281-297 | engine/packages/cli/src/cloud.rs:313-326 \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":"engine/packages/cli/src/cloud.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc5f064da72ab5a7653a3ff37b710eccd2e9c80a621e72b9ec2efd89f6066cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1329-1350 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1356-1379 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1385-1407 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1448-1472 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b5e9a434528bd0a512143af3509d77e0417f01f82ca7bda03ab5088c7ab522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/packages/api-peer/src/repair/calls.rs:496-517 | engine/packages/api-peer/src/repair/diagnostics.rs:24-43 \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":"engine/packages/api-peer/src/repair/calls.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cc031b66b882ceb1cc4cd65ed30ba55457fc48de8eaaa4d2a62006f5030d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 21\u002B corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:264-284 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:299-321 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:301-323 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:305-327 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:324-346 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:328-350 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:328-350 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac05b8364c209ad3cf820fb8f089fc067c8fd9efa34ea27509509bebf3b35b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rivetkit-rust/packages/actor-persist/src/versioned.rs:197-221 | rivetkit-rust/packages/actor-persist/src/versioned.rs:223-243 | rivetkit-rust/packages/actor-persist/src/versioned.rs:245-265 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/actor-persist/src/versioned.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"531222b3d73152b169ade91708e41b6f3906d5490fa74220a3175b9fdcb85c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-client/src/filesystem/client.rs:1893-1905 | engine/packages/depot-client/src/filesystem/recovery.rs:45-55 \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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fed592253814f97c8cfc57c2a542986e0354a7583ed95513cfb6c75752e052"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs:799-824 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs:945-965 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"132ed106b6200efabb4bdeef951c289b8a04a51796f98d93e527476c1fd87773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): engine/packages/pegboard/src/actor_machine/executor.rs:2062-2087 | engine/packages/pegboard/src/namespace_machine/executor.rs:665-689 \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":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d065e199f3c04b22a996abc30b5773e94462a925a3737341444f994d30fa7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/packages/util/src/async_counter.rs:57-75 | engine/sdks/rust/envoy-client/src/async_counter.rs:52-67 \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":"engine/packages/util/src/async_counter.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b020ca865b77f977ccf266da2a0b16c7693341bf59eada0bd80ed3a6f8edf52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): engine/sdks/rust/envoy-client/src/kv.rs:114-134 | engine/sdks/rust/envoy-client/src/sqlite.rs:491-511 | engine/sdks/rust/envoy-client/src/sqlite.rs:513-533 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/kv.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9b0f69e143cc4286749e28f71cb4fd855546c38b792e9414d7e674e2455eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rivetkit-python/client/src/events/async/handle.rs:65-84 | rivetkit-python/client/src/events/sync/handle.rs:47-62 \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":"rivetkit-python/client/src/events/async/handle.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5ac654fd47d32dcb687014e82dcf15e703a636a18fd25a70f7f566d9d9afaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rivetkit-swift/Sources/RivetKitSwiftUI/Actor.swift:53-68 | rivetkit-swift/Sources/RivetKitSwiftUI/Actor.swift:70-85 \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":"rivetkit-swift/Sources/RivetKitSwiftUI/Actor.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"88878eac110827ce7395c2d48c8f9df721cc785a5e7f488b56816417519af9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:233-242 | rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:244-253 \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":"rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec1e1cb41a445024bdec5cad45fc8f33ba84a8c972bfc052262fe8481746c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs:336-352 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs:454-471 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"218d6dfee88793008d621197b432714caef96c1364dc7209695451806ca811f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v1_to_pegboard_v2_migrator_v2.rs:37-55 | engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v2_to_pegboard_v2_migrator_v1.rs:47-65 \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":"engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v1_to_pegboard_v2_migrator_v2.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2736c3dadd258e1f4983d8d6d26ef54068a4888eab7c2a0f9ac7124001fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:357-374 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:378-394 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e28b807722b5cf584aee7b5d34c3485337edd30f45e26bb3bbb33fe4a69b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/pegboard/src/actor_machine/mod.rs:2493-2505 | engine/packages/pegboard/src/legacy_backfill.rs:1358-1373 \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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc33a2e097608f5fd1835f4bdc6fcc6bd619ad0ce65984bb3900975060f877e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/packages/api-peer/src/volumes/read.rs:129-140 | engine/packages/depot-client/src/filesystem/remote.rs:592-607 \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":"engine/packages/api-peer/src/volumes/read.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e10da6aad123ac43507b93c421c29e364405364c7f2a84d13496c271910ba62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 17\u002B corresponding lines): rivetkit-python/client/src/events/async/client.rs:42-60 | rivetkit-python/client/src/events/async/client.rs:63-81 | rivetkit-python/client/src/events/async/client.rs:84-102 | rivetkit-python/client/src/simple/async/client.rs:42-58 | rivetkit-python/client/src/simple/async/client.rs:61-77 | rivetkit-python/client/src/simple/async/client.rs:80-96 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/client.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c1d27e446a19ada03863db13687e979019d613fb1fb66d487d8e5cdcbbc704"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rivetkit-rust/packages/client-protocol/src/versioned.rs:31-41 | rivetkit-rust/packages/client-protocol/src/versioned.rs:437-632 \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":"rivetkit-rust/packages/client-protocol/src/versioned.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b756d18d01384deabfe67c3598569a7ea09a4744b932e0b626bf42e316872732"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:1187-1203 | rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:136-151 \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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e60ecc9e832e83ddaf825ab130d9fca1742dcc0f314eb6b60ec695b60b47a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/api-builder/src/wrappers.rs:58-77 | engine/packages/api-builder/src/wrappers.rs:113-135 \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":"engine/packages/api-builder/src/wrappers.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e4b61c7909cec7425cee0080a87dfd160f6f6ae8ef0321e0e5524592ad860c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/api-builder/src/wrappers.rs:58-78 | engine/packages/api-builder/src/wrappers.rs:113-136 \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":"engine/packages/api-builder/src/wrappers.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"26abc30f105f76946319acc38adcfd21c6dc759ae86fd98c144dd1e6d6e6efc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/api-builder/src/wrappers.rs:58-79 | engine/packages/api-builder/src/wrappers.rs:113-137 \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":"engine/packages/api-builder/src/wrappers.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f429f2eda54cda41a009d501fc1cb4252103d551529816597435902a4158500d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:123-140 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:147-164 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3bc1801a95a1356f3066f190ce87b228a74ee598717cd2286a501b356b1742"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:1179-1196 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:278-295 \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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f27de848b98c15c0189290cad626514f8e7ee830eafa8809f851b716de29a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-worker/src/object_store_metrics.rs:666-679 | engine/packages/depot-worker/src/object_store_metrics.rs:681-691 \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":"engine/packages/depot-worker/src/object_store_metrics.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93fa22dd190d580e42d8eef07aa0d8d3c17a3da5dc5a956ae90fd990f6137e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs:903-919 | rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs:926-946 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0d3cf9740ab73ccf431e66b7d0bb278333aadbf5cd5c71b64c95d188bc150c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:200-213 | rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:215-231 \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":"rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"718840cf141e36b4bf3e2817da4a6643409b724cb86d8ae859a84d4e3547c38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-worker/src/metrics.rs:658-668 | engine/packages/depot-worker/src/metrics.rs:670-681 \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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8439ab737d2c74e3f218cc4597e11fb64ac026ebb288e9f1e17e81904d6afcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rivetkit-swift/Sources/RivetKitClient/RivetKitClient.swift:115-123 | rivetkit-swift/Sources/RivetKitClient/RivetKitClient.swift:125-142 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/RivetKitClient.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd101c4c5095445d5777cb253b8ba9c111dfecafb07c55775666d93a38b6635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/packages/auth-jwt/src/keys.rs:51-66 | engine/packages/auth-jwt/src/token_id.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":"engine/packages/auth-jwt/src/keys.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ec7d707287feca186980ea3fa1fd60142a6d03e891aff405a30b705de3fad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/depot-volume/src/volume_client_machine/membership.rs:58-70 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/membership.rs:66-78 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/membership.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc4320df2ec543f06f57c28e417b6403d822a08f87134845312b268ae75b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/packages/pegboard/src/catalog.rs:739-754 | engine/packages/pegboard/src/commands.rs:611-628 \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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f3d2be1e014d8927171ba6b398ef97bf94f4eb30619f4b22c39ff8d29aa8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/packages/depot-volume/src/volume_client_machine/executor/recovery.rs:163-174 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:874-888 \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":"engine/packages/depot-volume/src/volume_client_machine/executor/recovery.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a341246edd63ea9d7ab51c65328985ae2175007bb591ee198c1ab649f92d721e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/pegboard/src/legacy_backfill.rs:1288-1305 | engine/packages/pegboard/src/legacy_volumes.rs:300-313 \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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78f708d07d98c46cd19bd0877fe30d708153c5b1a1474415d629169cd5d1ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 15\u002B corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:731-745 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:767-781 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:873-887 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:872-886 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:895-909 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:933-947 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:922-936 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:922-936 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d03c8d2e6caa15fbaf4d5e80532e5b7a62f74f0d9e74d29942fffc992e4eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/sdks/rust/envoy-client/src/handle.rs:553-567 | engine/sdks/rust/envoy-client/src/handle.rs:574-589 \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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"588439cc1a4adb69fa84c0df830dbd1245d0d3d3288243960b2dea82cbba4581"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:2166-2178 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:2180-2198 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b52a1eca77e1550b3d662a320919333465ae8452599bf551c70e9a5969b0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs:97-112 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:2567-2582 \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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9d591a56ca9d20488323592adfb9b2f7821e3e489132473ed5de99e93ebc6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/packages/api-builder/src/wrappers.rs:32-75 | engine/packages/api-builder/src/wrappers.rs:91-133 \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":"engine/packages/api-builder/src/wrappers.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb27a5f5696a1ea4d1c576a4e8e5a6d932c68a95f2908fb757dea6f44f0d5ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/packages/api-builder/src/wrappers.rs:32-76 | engine/packages/api-builder/src/wrappers.rs:91-134 \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":"engine/packages/api-builder/src/wrappers.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d761cce2c6f42e1836474eeb9f5d924dcd19e5088fa168213dd57d3301a059"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/pegboard/src/catalog.rs:413-426 | engine/packages/pegboard/src/catalog.rs:437-452 \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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ffe3d77a7b08faed401bdcc15c8db44bf9cd7885177745aa9df5ffcde43d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:958-969 | rivetkit-swift/Sources/RivetKitClient/ActorHandle.swift:225-234 \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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7b08b1f4f5a8ac252ca0ef8a2ea34bf756c2fe18023b18e7b7a916dbee30ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs:318-325 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs:345-352 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a1ba55856b5558559b6f8c6f14457f3747f092252413f67b4a7d126c0e4752"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs:1714-1731 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs:692-713 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7490084efebea814a7bcf9f24e515d4ea6d3a7e68ec77d100ea4e8fbac2f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/packages/engine/src/allocator.rs:29-43 | engine/packages/engine/src/allocator.rs:46-64 \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":"engine/packages/engine/src/allocator.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d04e7fdbcd7a424405a1a5fb9965ce8234a54d6d56290c04b7965fc064bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rivetkit-rust/packages/client-protocol/src/versioned.rs:330-339 | rivetkit-rust/packages/client-protocol/src/versioned.rs:343-352 \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":"rivetkit-rust/packages/client-protocol/src/versioned.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e63831173a3288e0e221313f24af79f604a714226817bc9f882dd282e24d8f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:876-885 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:919-928 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:944-952 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:957-965 \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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"2382779e133a7b5632486ac2cd79718e8133f11fa587fd03959d30089fbaf602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/packages/depot-volume/src/volume_client_machine/executor/recovery.rs:144-159 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:856-870 \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":"engine/packages/depot-volume/src/volume_client_machine/executor/recovery.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c09cd07e129e3f1487dad767b3fcb85a3b5d9977d97a45ec82c86e1608aa34b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): engine/packages/depot-client/src/filesystem/remote.rs:387-404 | engine/packages/depot-client/src/filesystem/remote.rs:413-424 | engine/packages/depot-client/src/filesystem/remote.rs:435-447 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"engine/packages/depot-client/src/filesystem/remote.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"8751bb713122f1a12edc29e9055123d758842364e634129d2e623b8b02dcef37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/depot-volume/src/volume_client_machine/membership.rs:21-33 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/membership.rs:33-45 \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":"engine/packages/depot-volume/src/volume_client_machine/membership.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1512d216e7884487ba1df93d4500d530d9b8059b7a6141c875e5b1ca6577350b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/materialize.rs:269-281 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/materialize.rs:466-478 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/materialize.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83e7418d16ec1143891b8ee9d0d175a60b9b1483626d770f27492fa76bd4a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/packages/util/src/async_counter.rs:77-99 | engine/sdks/rust/envoy-client/src/async_counter.rs:69-84 \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":"engine/packages/util/src/async_counter.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e74487b4225ad76e7669c81ea0709ef92e55f171e62714067123ba8af8a6b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:1074-1086 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:2536-2548 \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":"engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c820df6c43c8e8f55545b2a3a44eee78a2fa853f1d73b04ff26eda873cc924"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/packages/pegboard/src/catalog.rs:1360-1376 | engine/packages/pegboard/src/index.rs:1913-1929 \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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d23dcb685ada486b5b41eefcf4099b868160016bb40fc17a6e4cbb8870c9bc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:304-317 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:320-333 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:336-349 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:352-367 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae943cdc4267bf8bd1300a563283309c32c6e5c7d4edd6e0130ac18fc205a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:398-408 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:415-427 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"01353891d2fc70fee69e97ca6eae5367ef8d46208b55038bd70a637c4c684c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:418-431 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:435-450 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:1883-1896 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:1900-1915 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc94e7e3edb9b33ceeeff1d02dba9eedbc253a0b55eda3e4668a197b3aaecdbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:168-188 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:341-357 \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":"rivetkit-typescript/packages/rivetkit-napi/src/registry.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"39638aaa4d16db1cd411cf5a050868cb76e1483f06f9f07267e48c589d5ae3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/packages/api-peer/src/repair/inspect.rs:379-390 | engine/packages/api-peer/src/repair/inspect.rs:409-420 \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":"engine/packages/api-peer/src/repair/inspect.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d60de2bd9a9a033dee9cbbea4799dd16b509a7adf3241e40228d4976594c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs:723-744 | rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs:897-919 \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":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6de9768cf102d62c8808a1361bd1a809835fe7e670eaace94d0916054446142"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rivetkit-rust/packages/rivetkit/src/registry.rs:154-169 | rivetkit-rust/packages/rivetkit/src/registry.rs:173-189 \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":"rivetkit-rust/packages/rivetkit/src/registry.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da52ae9ee6b03d458b4134b88a01464c185bb9a4cb69e6c70085b0cc6518842"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/kv.rs:60-74 | rivetkit-typescript/packages/rivetkit-napi/src/kv.rs:82-96 \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":"rivetkit-typescript/packages/rivetkit-napi/src/kv.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"955dca68b4454b90b559e8ec8ca8b2308cd42d8262a1e4b8c2398c7ebf0621b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/depot-client/src/filesystem/cache.rs:66-72 | engine/packages/depot-worker/src/filesystem/fork_reads.rs:256-262 \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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f448bcccd387ddf3665f8aa97c42494565698e07313bd3b7cd5920dd82ca90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift:30-36 | rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift:38-44 | rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift:46-58 \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":"rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a1bc945f5c806f6d39d248f2e21f213be3465ff92e611e04cd4cdc1f286548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/packages/api-public-shim/src/routes.rs:2429-2441 | engine/packages/api-public-shim/src/routes.rs:2447-2456 \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":"engine/packages/api-public-shim/src/routes.rs"},"region":{"startLine":2429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd882a3efe50fb9a5deaa2bfe5d19621c21fe3566c98c1ca4e924f12761139d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:210-223 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:1675-1688 \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":"engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"af28a3717a554bab0f23c1e60399503423a5da3b9bd9f1d38e340a4ae2822e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:715-730 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:2182-2195 \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":"engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a60656a4c82cfbf3a0aee00b102fb03c280feb2e59ab49cd02b3486397a914"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/http.rs:78-92 | rivetkit-typescript/packages/rivetkit-napi/src/http.rs:95-106 \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":"rivetkit-typescript/packages/rivetkit-napi/src/http.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfe99c070b588179edac814e096d88c3c8f59708a2362ba94782cd8d6a56013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/sdks/rust/data/src/families.rs:184-197 | engine/sdks/rust/data/src/families.rs:223-236 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/families.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"30faf311431a7485d21321cef7e266019627de083d3abc162c699bb78dd4e196"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/sdks/rust/envoy-client/src/handle.rs:281-298 | engine/sdks/rust/envoy-client/src/handle.rs:315-335 \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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd96d3d3556176005321fae53aa15f90fa9f33f04b040c21c2e2b2081e9409a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs:599-612 | rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs:631-644 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7995cc563637bd647536dcbc057e2f448005c5d3e2ea364eca370d3d1a96789"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs:81-96 | rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs:210-224 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2a7b64344cbb77e3e78eb6a8c96da12b72d0b4c25b5d551aed6f8b9ed1557d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/packages/depot-worker/src/services/storage.rs:157-169 | engine/packages/engine-context/src/services/depot_client.rs:185-194 \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":"engine/packages/depot-worker/src/services/storage.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"690634881d8e634d06d039c7b6f594a21b139c9aa7444585388ac70cd8219407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/sqlite-prefetch/src/page.rs:281-294 | engine/packages/sqlite-prefetch/src/recency.rs:338-350 \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":"engine/packages/sqlite-prefetch/src/page.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe45c94bcc471216494de3819a0aa7150670a24133652046fd48e12d5fd1bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rivetkit-swift/Sources/RivetKitClient/RivetKitClient.swift:35-51 | rivetkit-swift/Sources/RivetKitClient/RivetKitClient.swift:59-75 \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":"rivetkit-swift/Sources/RivetKitClient/RivetKitClient.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c940fa79a5d17d86ab1ea6f1fdadd1d736a77220947798270a03a6621e236275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/members.rs:49-59 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/members.rs:66-77 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/members.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2112f9662f6eaf3d8477f9b41adc3ee31ad312dc971186c1b59e5538d818729b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): engine/packages/pegboard-envoy/src/sqlite/lane_transport.rs:105-117 | engine/packages/pegboard-envoy/src/sqlite/lane_transport.rs:119-131 | engine/packages/pegboard-envoy/src/sqlite/lane_transport.rs:136-150 | engine/packages/pegboard-envoy/src/sqlite/lane_transport.rs:155-169 | engine/packages/pegboard-envoy/src/sqlite/lane_transport.rs:174-187 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/sqlite/lane_transport.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea5b7d2cd986816348847ea94dcfbc5a3b8e9f2bf5d85aaabef840e125e6bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/pegboard/src/keys/partition.rs:178-184 | engine/packages/pegboard/src/keys/partition.rs:193-200 \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":"engine/packages/pegboard/src/keys/partition.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"44870bccf979e24dd48512d3f1192a9ac13643b4fc14f1189e3cc2726e6e5690"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs:537-553 | rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs:555-570 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"096b8c970f2ba6c91913aaa6d7b98935818216bfe5f0619d7a5cff0f8221ab2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): engine/packages/cli/src/cluster_env.rs:36-50 | engine/packages/pegboard/src/validation.rs:204-219 | engine/packages/pegboard/src/validation.rs:221-236 \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":"engine/packages/cli/src/cluster_env.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93d106f436038429abca765c5647138f1beec800a36907fe482c052ae22f7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/cli/src/commands/pool.rs:157-167 | engine/packages/cli/src/target.rs:286-293 \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":"engine/packages/cli/src/commands/pool.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1621049ccf63ee4bfbefcf429e7f97b6d1d66dba7180114c8cadd4b28fae627b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/pegboard-envoy/src/connection.rs:2691-2705 | engine/packages/pegboard-v2-migrator/src/v3_actor.rs:80-90 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac27c98ac0691e2ee271bb62cbf230074f7c227dfe56188ff90f43c1c93dc39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/packages/pegboard-gateway/src/http_tunnel.rs:355-368 | engine/packages/pegboard-gateway/src/websocket_tunnel.rs:326-337 \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":"engine/packages/pegboard-gateway/src/http_tunnel.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5b222b9a32a07722b8066472cf8f28e99831f4d6172da2df1596444798ed8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/packages/sqlite-embedded/src/query.rs:130-139 | engine/packages/sqlite-embedded/src/query.rs:147-156 \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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcde31a27aa96792a78231022629d3ce39db30eea69326bc355d7dded3ab175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/cluster-config/src/cluster_config_machine/state.rs:37-44 | engine/packages/singleton-coordinator/src/singleton_coordinator_machine/state.rs:72-81 \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":"engine/packages/cluster-config/src/cluster_config_machine/state.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"236e072a28b64d03215be1c615d03112fbe596d78fdf1b18e6295cf6ccef1c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-client/src/client_protocol.rs:162-172 | engine/packages/depot-worker/src/command/volume_host.rs:2533-2543 \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":"engine/packages/depot-client/src/client_protocol.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f1bd5fe17cbb92007dc3ded24cd72518dae6f25f78748571c3770250520c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/packages/depot-worker/src/filesystem/fork_reads.rs:238-253 | engine/packages/depot-worker/src/filesystem/session.rs:449-467 \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":"engine/packages/depot-worker/src/filesystem/fork_reads.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a93ce24a95d9152c1dac5ec8cd369f24540f01a549abb2e6f6ee5874b4aba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:281-293 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:1746-1758 \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":"engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4ed06cfc28e5b673bce451160550acade8cf3b119174e4cbe17dac59037cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift:117-124 | rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift:132-139 | rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift:152-159 | rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift:173-180 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitSwiftUI/ViewModifiers.swift"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"81788b1e9d73cb0466cd2e933719b18becbcc244b08f8b4cc611e068fef0f12f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-worker/src/command/kv.rs:15-25 | engine/packages/pegboard/src/index.rs:622-635 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/kv.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9521a810c3439603b13adc268f5332849a30a5ff5e8e33e110c42398d9324a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs:1655-1671 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs:1945-1957 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8af68d2b2021bf31cf38bbc02d5d419c00f36b9eed98b1564f4cb4a5aba368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): rivetkit-python/client/src/events/sync/client.rs:39-51 | rivetkit-python/client/src/events/sync/client.rs:54-66 | rivetkit-python/client/src/events/sync/client.rs:69-81 | rivetkit-python/client/src/simple/sync/client.rs:39-52 | rivetkit-python/client/src/simple/sync/client.rs:55-67 | rivetkit-python/client/src/simple/sync/client.rs:70-82 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/sync/client.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b2c7e170fd59a1d62aedf942b26175864c5c9139ce4d755597c21a88c88992"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/queue.rs:349-362 | rivetkit-typescript/packages/rivetkit-napi/src/queue.rs:367-382 | rivetkit-typescript/packages/rivetkit-napi/src/queue.rs:387-398 \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":"rivetkit-typescript/packages/rivetkit-napi/src/queue.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4993e6d3614d68835b449be6a6241c1a45e1ed83b88761231f35da6cf07e904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/packages/keys/src/keys/codec.rs:405-410 | engine/packages/keys/src/keys/codec.rs:445-450 \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":"engine/packages/keys/src/keys/codec.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"242d9fa94ee6318581d0c71a8c7e95407c341d608713ca70218169e55fe8069d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/sdks/rust/data/src/versioned/topology_worker_heartbeat.rs:65-79 | engine/sdks/rust/data/src/versioned/topology_worker_heartbeat.rs:84-97 \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":"engine/sdks/rust/data/src/versioned/topology_worker_heartbeat.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e0a4960aef9691aacc1be502b933bb822e55204a6d66db0ccc2bf0fe99a563"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:177-185 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:233-244 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ef1c5fbe1a85ec933525d64041a6bbe26223204ffe799b75138054a460c975"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1710-1723 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1725-1740 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a68afd855c76a522299b42f5f42707a18a7965e1093c949e4797c7128e20c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:2949-2959 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:3102-3113 \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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"750cdf0240c62dd3c92b15785a0419994fbaa7e7c8aeffad344bc592a5d89f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/packages/api-public-shim/src/lib.rs:23-38 | engine/packages/pegboard-gateway/src/lib.rs:26-42 \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":"engine/packages/api-public-shim/src/lib.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a390735d99c55cdf4319fa0bdda224b2471eb78e9c85a2695e8c6c1af10c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/packages/api-public/src/auth/tokens.rs:28-42 | engine/packages/api-public/src/auth/tokens.rs:132-143 \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":"engine/packages/api-public/src/auth/tokens.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d804d81263419e875ab6d78548ab7361c988fa52d59a87dbc359d64595c20647"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/depot-worker/src/filesystem/session.rs:923-930 | engine/packages/depot-worker/src/filesystem/session.rs:1111-1128 \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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5fc4bb68b4dfe0674b35847f42330c1243fdbba3f74ef0705aeaf60ed762e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v1_to_pegboard_v2_migrator_v2.rs:22-33 | engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v2_to_pegboard_v2_migrator_v1.rs:32-43 \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":"engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v1_to_pegboard_v2_migrator_v2.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8875bfa7bffa3c9f9351ea402014931e866eac8e57a7b7ad6c61ecfd9a20c29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:1079-1088 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:1331-1346 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"baadbc60d0890751f6f6b42bf994f5956fe8262eec5a60fc262c73a8016203d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:2631-2644 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:2646-2657 \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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":2631}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeb942089a5c634aa52224c57e9f2a211a12ea81c8285750bddb85614a485d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/depot-client/src/filesystem/txn.rs:413-420 | engine/packages/depot-client/src/filesystem/txn.rs:473-483 \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":"engine/packages/depot-client/src/filesystem/txn.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"837f254b4ddcc3e86209411e14023894283a762b1cb8ae9a2933026974bb9a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/depot-fs-core/src/store.rs:162-168 | engine/packages/depot-fs-core/src/store.rs:198-205 \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":"engine/packages/depot-fs-core/src/store.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae7358417881fecc7f5969bcd0c823f40b04219969fedd99ae064191962d912"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs:229-240 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs:241-254 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3dba19c9db5d9865b4afd213c0a8a3d56d06fa5747d08760693a1c7ba620a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:774-787 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:810-822 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bbfa7fbd8eb8238aa7a63c5df130864d01690d6246724d10dcd08b5727a4da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:484-498 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:797-811 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8b2356df0bf7f6c5724067a058790bc81d9144e355c70af0d821758bf36f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:465-480 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:484-496 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:1930-1945 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:1949-1961 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c74ec1c5f9c1e864b441b3c015635419ec975d06c961f21186cda30c301efd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/kv.rs:114-123 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:2105-2115 \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":"rivetkit-typescript/packages/rivetkit-napi/src/kv.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bb4bdf01f023731a8a42dfd1e0f9d3f5b228403ec26ceba0c6f044fcc9ac8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/packages/depot-client/src/filesystem/cache.rs:1379-1388 | engine/packages/depot-client/src/filesystem/transaction.rs:705-714 \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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"904b13bd5ff850ebdcddabc8adf8fe7376ba6b00f47cf166f4e99c1f967e9efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/pegboard/src/actor_machine/mod.rs:2445-2458 | engine/packages/pegboard/src/actor_machine/mod.rs:2749-2763 \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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"187c1d9e5c35febdd59b3e6a0c28b5fa0b7a7c56ea49e2fa38b80252be0f0dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v1_to_auth_grants_v2.rs:47-57 | engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v2_to_auth_grants_v1.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":"engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v1_to_auth_grants_v2.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"538753ac44f58b0a87666f87b381ec6d72aec738dd4bf4e4ff6d9c730d42ca2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:500-511 | engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs:1965-1976 \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":"engine/sdks/rust/envoy-protocol/src/versioned/v8_v9.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8380d9b0cc18057cb9b6801b92fc47f032d05a2ce8c683944493d7f0a74bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1437-1447 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1450-1463 \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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d0d5600d4342152f4656678e222642274d85ed4a5931e969f8f77d7bceeb73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): engine/packages/api-builder/src/extract.rs:39-52 | engine/packages/api-builder/src/extract.rs:71-86 | engine/packages/api-builder/src/extract.rs:98-111 | engine/packages/api-builder/src/extract.rs:123-136 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-builder/src/extract.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"043baa072c29509e921678bd949cf5b699f04f3f18c72f648e7a97ade917fbfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/singleton-coordinator/src/singleton_coordinator_machine/snapshot.rs:40-46 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:46-52 \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":"engine/packages/singleton-coordinator/src/singleton_coordinator_machine/snapshot.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf5acc6934ad5cb165e644d063f504164335c0de9e92eb1a013263d3adfb58e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/sqlite-embedded/src/page_buffer.rs:106-113 | engine/packages/sqlite-embedded/src/page_buffer.rs:114-124 \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":"engine/packages/sqlite-embedded/src/page_buffer.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f248bd8713f3144089e1d817d2e28c2ef3e4d3a8ccd45c894387d85e5dc95301"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/packages/util/src/async_counter.rs:16-24 | engine/sdks/rust/envoy-client/src/async_counter.rs:25-33 \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":"engine/packages/util/src/async_counter.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0af1762d856d193c1b08c14c3eab95eaa672ad2d381a78ffa8feeea6490b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:578-587 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:596-605 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:615-625 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:635-645 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:652-661 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:668-677 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f137a84bcf75a1295bdf516ebf8b55b0d2cb517a5ab9be30f503f5912d3ac32d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs:1480-1489 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs:1727-1736 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"146e1a3aba3cdfcdda83a19182550cba75a67ac6dc6479f27de15cf8b9de3cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/member_repair.rs:230-239 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/opening.rs:368-378 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/member_repair.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"082c8a5b3e538857bf16a28e2c54cbf0f495dd668b7af363e6222d3bec4fbccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs:1155-1161 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs:1165-1171 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce060d5e4ead6fdd5141b54949e6b4351f34c93261b2f2a165c6f5f4ffcbf81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/packages/pegboard-envoy/src/queue.rs:95-109 | engine/packages/pegboard-gateway/src/namespace_fallback.rs:71-85 \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":"engine/packages/pegboard-envoy/src/queue.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"791331ee066d0afc1865f67496ceab61edb544bc81d8f15f16b79f00e3f6f888"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): engine/packages/pegboard/src/catalog.rs:1907-1916 | engine/packages/pegboard/src/catalog.rs:1939-1948 | engine/packages/pegboard/src/namespace_machine/mod.rs:930-942 \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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"027cb8cbd6ab042adb12271bfbd3c2a42e95641ad1f439456e4378cff4d1c874"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/packages/pegboard/src/namespace_machine/mod.rs:720-728 | engine/packages/pegboard/src/namespace_machine/mod.rs:1062-1070 \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":"engine/packages/pegboard/src/namespace_machine/mod.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d198f79be6f1d183c8ee1fec4bf5ce3d8f2c800b68d6668a7784495eea80c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1648-1658 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1671-1682 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1685-1695 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad3fbd188e1871c15e7dc58612163a812411b14ff7c45269632405aff24116a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/depot-client/src/filesystem/client.rs:2153-2167 | engine/packages/depot-client/src/filesystem/client.rs:2182-2194 \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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5092e7c31b9aac937be6421e4df6ef99cc04975d83c9ea764b752a1c5f4b9483"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): engine/packages/depot-worker/src/object_store_metrics.rs:693-700 | engine/packages/depot-worker/src/object_store_metrics.rs:737-744 | engine/packages/depot-worker/src/object_store_metrics.rs:746-753 \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":"engine/packages/depot-worker/src/object_store_metrics.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"766b7d1b23f6303ef815cdc05e9b7d5a62fdb29c18847c60d239065857377d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs:552-561 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs:406-415 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67e52510d65946f4777c87b34854d64f419ccca3b07567194283ae7cedadbf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/packages/depot-client/src/forks.rs:296-309 | engine/packages/pegboard/src/actor_machine/executor.rs:1252-1268 \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":"engine/packages/depot-client/src/forks.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c416db873bab4adfd16578570dbe08140f6f18f2b34ed451a27c801ce2df09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/pegboard-gateway/src/routes.rs:917-924 | engine/packages/pegboard-gateway/src/migrate_from_v2/mod.rs:85-92 \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":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cee332fc5e7a07d15711bbf84e004d260ef1180c70260ccfbe9af4a9c378f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 13\u002B corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:578-590 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:608-620 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:710-722 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:709-721 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:731-743 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:761-773 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:757-769 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:757-769 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fafcc33630ab70929fe6185d45821cdf0b604f1fa3fe4bcadeb280068b3e575"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/sdks/rust/envoy-client/src/handle.rs:491-507 | engine/sdks/rust/envoy-client/src/handle.rs:515-529 \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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5759e09e7d80ad3ee41650ea0f9105b444b2a7430da2cc26b2659a89c17f73ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-client/src/filesystem/client.rs:2068-2078 | engine/packages/depot-client/src/filesystem/client.rs:2238-2254 \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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"317a08ae226ab7707b32bc93e7ca03a3e28ac5cd41dfc2e08e2ace2fce9baef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/sdks/rust/envoy-client/src/handle.rs:230-242 | engine/sdks/rust/envoy-client/src/handle.rs:890-903 \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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dec23dcfb5d651b68151c26acca16b0029ed04dab2e0c1979cfb6c21bcf35d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-client/src/filesystem/cache.rs:258-268 | engine/packages/depot-client/src/filesystem/rollback.rs:104-114 \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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeb76321a7e602abd9345a2fd1ae9171ddbc257bc29182329e4e71301470dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/util/src/async_counter.rs:105-119 | engine/sdks/rust/envoy-client/src/async_counter.rs:110-122 \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":"engine/packages/util/src/async_counter.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"58316377da61a2d63a6d31e1f2fe737782e85db3f9d0504db85e878f0d135325"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rivetkit-rust/packages/client-protocol/src/versioned.rs:555-639 | rivetkit-rust/packages/actor-persist/src/versioned.rs:423-431 \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":"rivetkit-rust/packages/client-protocol/src/versioned.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0c1ea8e119ed4bf93d405a02c557217bc9b6399dc4e159aa276adb554a8c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs:2853-2863 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs:2866-2876 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":2853}}}],"partialFingerprints":{"codehealthFindingId/v1":"11948388b651cb719f4e1d6398d59a30121d44cedf4326535353ff7656ba13ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/sqlite-embedded/src/query.rs:729-736 | rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:990-997 \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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"249a7ab0e37d31645de8ac9120f9e39f4cfbe0778a8ae660f9aa4b86db3fb433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:552-564 | rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:591-603 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa18107b871918a11fdbae3067d7ca28c0242851151406f68f983eca7d593fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs:1233-1240 | rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs:1264-1272 \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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa56a5490abf5b2fcd213f3842c7263b106214380536a32ad158fb7b2f0d63a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/packages/cluster-config/src/cluster_config_machine/executor.rs:55-63 | engine/packages/auth-jwt/src/key_ring_machine/executor.rs:31-39 \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":"engine/packages/cluster-config/src/cluster_config_machine/executor.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e929accd3f1d866bb238cc530694e28bf1d3b29390e10dc1bdc9119887a583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1030-1050 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1060-1076 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"1232e6bb9900d2750fa58d428781c1eca3485ea24fba08c053f6d428a0dab660"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rivetkit-rust/packages/client/src/handle.rs:200-207 | rivetkit-rust/packages/client/src/handle.rs:252-258 \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":"rivetkit-rust/packages/client/src/handle.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57e800957779b54e1d266bff1a1f58d9ccbb48891fdd8049c11f954a98570f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/cli/src/commands/cluster/env.rs:77-83 | engine/packages/cli/src/commands/cluster/secret.rs:82-88 \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":"engine/packages/cli/src/commands/cluster/env.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a97bb66625d3e10e7e80fd44f1fa58186628fdc3b4c83c0e52a587ef8a21f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:946-953 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:1157-1165 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:1168-1176 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f10464ea1be443aaa75d09947beadd6df4abb1d0e5fedf108fff33a0c390d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:475-483 | rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:893-900 \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":"rivetkit-typescript/packages/rivetkit-napi/src/registry.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c9d43526e4430d786b0baf3ea7230a40b8e271c6dda3722fb2239c012d827"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:10-20 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:11-21 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebedf1303b1f2453fc88e750f525fa25500f60d2405afbdac2b5d306ba9d83a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rivetkit-rust/packages/rivetkit/src/start.rs:507-519 | rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs:900-911 \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":"rivetkit-rust/packages/rivetkit/src/start.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b40dd1cc5bfbeec4a159b0135cfff48a95a58aed7ce8a0849f59bbdb4d58da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/packages/depot-volume/src/ups/client.rs:153-165 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:345-357 \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":"engine/packages/depot-volume/src/ups/client.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"107c69b12d6bea09808e5c22b81725c82672d99f6108c9bd221b3fbbabf180a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:113-120 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs:108-115 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a45b309d1a7fc763b930da7b6a246cdb2295c57a2e0ca16e3132ea5a9289b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/engine/src/epoxy_services.rs:90-100 | engine/packages/pegboard-v2-migrator/src/services/migrator.rs:94-100 \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":"engine/packages/engine/src/epoxy_services.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"de57e8c6da5bc0cb18f10d21d5154f4199cfef6b6133f207ac3b79df88d2367d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): engine/packages/env/src/capabilities/tokio/task.rs:158-164 | engine/packages/env/src/capabilities/tokio/task.rs:212-219 | engine/packages/env/src/capabilities/tokio/task.rs:226-233 \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":"engine/packages/env/src/capabilities/tokio/task.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ac94685a02d7393b9f760001d726b41b592e57a09d707726879714567c965f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/pegboard/src/legacy_backfill.rs:1753-1763 | engine/packages/pegboard/src/actor_machine/mod.rs:2676-2686 \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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9acbe1c92ad7666e20809cd3b5a98284d15127f581382ad4d7410bf6fab2ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/packages/auth-jwt/src/key_ring_machine/mod.rs:266-271 | engine/packages/cluster-config/src/cluster_config_machine/mod.rs:249-254 \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":"engine/packages/auth-jwt/src/key_ring_machine/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"935ae809901491aa36bcfdf7d6116ea24712b47436045dcc79a3cc449a4733f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/packages/depot-log/src/log_shard_machine/state/replica_table.rs:112-121 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/volume_keys.rs:82-89 \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":"engine/packages/depot-log/src/log_shard_machine/state/replica_table.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a2e9ec51760bcbfc1378649bce8970e0b166b7b258bdde51da7f975d1a816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:1401-1407 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:1523-1529 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:1541-1550 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:1552-1558 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"593317b7a7a6eb4620ae5a6c73384a5bbf8614b04b259ccba281ab0b30d124ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): engine/packages/depot-worker/src/filesystem/pending_work.rs:202-211 | engine/packages/depot-worker/src/filesystem/session.rs:1998-2007 | engine/packages/pegboard-envoy/src/kv.rs:319-328 \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":"engine/packages/depot-worker/src/filesystem/pending_work.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed57d92fc0b2466c6ed403d555af38e3ecbebb468b8326f55e75641770c553d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/packages/pegboard-v2-migrator/src/commands.rs:68-74 | engine/packages/pegboard/src/index.rs:999-1004 \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":"engine/packages/pegboard-v2-migrator/src/commands.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbc5a4a1b823df97d3a16eabf7324144958612c02ad903590a43bea8219d2e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:867-877 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:901-910 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:1008-1018 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:1058-1068 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d5f6f630870d1e02d4e159f75b826208e3e9d226f3824c007befb157cc7be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:94-103 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:96-105 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf0372733c1e3393d3678148d75571e8ef4a1b22b1e5d307a4257c423891c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/packages/depot-volume/src/volume_client_machine/membership.rs:36-39 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/membership.rs:59-62 \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":"engine/packages/depot-volume/src/volume_client_machine/membership.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a74d2a18b16648b9071146262a6e81a713fe6d7a16a7c764740da4a9119e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rivetkit-typescript/packages/rivetkit-napi/src/kv.rs:126-132 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:2118-2125 \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":"rivetkit-typescript/packages/rivetkit-napi/src/kv.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"781423143e8c0460d42627db18d8c5db756c6a8df2ee5c06342d94e5af64e278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): engine/packages/api-public/src/actors/list_names.rs:34-39 | engine/packages/api-public/src/runner_pools/delete.rs:32-37 | engine/packages/api-public/src/runner_pools/list.rs:51-56 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/actors/list_names.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0783e05001b8aafa59872e9fc0d2bc2154442b1af0aaf6ef040fc4fda952f662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:1246-1252 | rivetkit-swift/Sources/RivetKitClient/Errors.swift:9-14 \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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d6f6cb496211cc5097155fe6905ca175523493d92478f90b73d262941e65b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/packages/guard-core/src/errors.rs:138-148 | rivetkit-rust/packages/rivetkit-core/src/actor/context.rs:2072-2083 \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":"engine/packages/guard-core/src/errors.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5420b11fd730493c3ce9eb3004bc98153e1084a7388596a4ab26d3579679f7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:1069-1077 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:1228-1236 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"935f82962d8bcaf745b18af33a0d0d6fdf28f83e8b2ebedb84a74f61db5fc5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:996-1004 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:1046-1054 \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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1b16cd4690565172cee35e688e2e4610d3a598e87a68050d737bba69e75234"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/packages/depot-client/src/filesystem/cache.rs:272-275 | engine/packages/depot-client/src/filesystem/rollback.rs:147-150 \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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"160a29964d18205f0c09075f55226e2fa4c3c298ff849c2de313ff2b7927ac22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs:349-355 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs:1144-1149 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs:385-390 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ea4b2dbbdddc1e03f501f86be469ebf8155aae2a985f533a01846c7a04c6e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/engine-context/src/context.rs:160-166 | engine/packages/pegboard/src/catalog.rs:175-181 \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":"engine/packages/engine-context/src/context.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9536db70eeadb27ee47db802b770827c5985615ee800bdbd190f9dca561aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/sdks/rust/migrate-from-v2-protocol/src/lib.rs:66-71 | rivetkit-rust/packages/rivetkit-core/src/actor/keys.rs:120-125 \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":"engine/sdks/rust/migrate-from-v2-protocol/src/lib.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b736e06b58848e92b8364e7cf711fffa5a607067ed6b715b0ce409de9279095"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs:413-419 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs:483-494 \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":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f4a5ab9f0446d68cd44f281ca6bd3edc82c705bd2387f600704e59b3d0aa58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:1277-1280 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs:833-836 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca507a9f8decbc0d19158dcbeba713bd2fc0fcab1054b19e5ae533e14b81bb5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_cleanup.rs:128-134 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/materialize.rs:223-231 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_cleanup.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c794eacf9ad72f9f319d8119fa9bbbf33a5fa06f56ab6b7c627431dfc7e35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:255-262 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:279-286 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:285-292 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:304-311 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:308-315 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:308-315 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b088d117cbb76002661ffcdadf1e8df7f28390cb3fb34c92a9972c41246f902f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/packages/depot-client/src/volume_requests.rs:448-453 | engine/packages/depot-volume/src/ups.rs:37-42 \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":"engine/packages/depot-client/src/volume_requests.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9148f5e70e0654413408c70d86b5e0805376d63c94e05a5905015838872ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:1409-1414 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:1516-1521 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a965388aca770b21fda19c7552f17ae6ad9e1e51ab691b9ba25affc5c038987d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): engine/packages/depot-client/src/lib.rs:58-62 | engine/packages/depot-client/src/volume_requests.rs:499-503 \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":"engine/packages/depot-client/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"572a64dcfe205c5e0b6c4b5f1a85fa768862bc45b1f9b38e2821427a499d6374"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs:105-111 | engine/packages/state-machine/src/deadline_queue.rs:157-163 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/alarms.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7cd1537ca8081c64a7dbef400f03593105fc673a222393b96d194a0e75c9a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:1105-1113 | rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:160-168 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec511ccb1cff6c8b6435834d585d8185f2fa3b6b70f3e956477ad44f08d3a18d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs:2892-2897 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs:271-276 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":2892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9313aeffcc90523f26b9cd0ffcbb056c8170df1cd768b53c994cb5496ce96148"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:3522-3528 | engine/packages/engine/src/depot_peer.rs:218-226 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":3522}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a191e89da13cb4a9cacc9000dda576073fc47ad337543c6941d31cdc4f1eb35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): engine/sdks/rust/envoy-client/src/metrics.rs:352-359 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:3354-3361 | rivetkit-rust/packages/rivetkit-core/src/serde_metrics.rs:156-163 \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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eb095f831ccc963f7b04008b711342d4606566011fe988036830017eca790e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:1388-1393 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:1531-1539 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"03049234ef75d59448717c1ca57b7513d7767e149eec01165438371be007d96f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:3265-3270 | rivetkit-rust/packages/rivetkit-core/src/serde_metrics.rs:25-30 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":3265}}}],"partialFingerprints":{"codehealthFindingId/v1":"038f0850cf0e315cd62692bc47c911ef97a87448fdd2a8f7712ce64bf1bcbb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/packages/depot-fs-core/src/keys/slatedb.rs:355-361 | engine/packages/depot-fs-core/src/work.rs:27-32 \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":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d3c992091cc6946a9f7f11e7765f346eb8ece85c19b4a4e53c386dc2d9261d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 5\u002B corresponding lines): rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:1449-1454 | rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs:1459-1464 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1972-1976 | rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs:710-714 | rivetkit-rust/packages/rivetkit/src/action.rs:46-51 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d166d0d436c5668c46ad1e173685d45d9fc5027a060528df602d940fcd769a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/packages/depot-worker/src/filesystem/repair.rs:22-28 | engine/packages/depot-worker/src/filesystem/store.rs:172-177 \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":"engine/packages/depot-worker/src/filesystem/repair.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23f374e109c22900c2ae6d24e8ad088b1a2ff3cb753316de38c723243739877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:186-193 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs:412-418 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4049941c020339598a3f2f2aa3356c754553fefc54279904f4f1d3a196adfa1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): engine/packages/env/src/capabilities/fs.rs:134-141 | engine/packages/env/src/capabilities/host.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":"engine/packages/env/src/capabilities/fs.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfae2160a8e3602b40fbee26dd55996cc045b8a837a5bbdd6c8860ca1478527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201343 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:2104-2146 | engine/packages/sqlite-embedded/src/vfs/transport.rs:2260-2299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/vfs/transport.rs:2104\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"126db748b72a43f9bf747685b5edc84d82b2456eefca6ef917ea8c74e4276a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201332 lines \u00D7 5): engine/packages/pegboard/src/actor_machine/mod.rs:161-185 | engine/packages/pegboard/src/actor_machine/mod.rs:377-401 | engine/packages/pegboard/src/actor_machine/mod.rs:575-606 | engine/packages/pegboard/src/actor_machine/mod.rs:724-748 | engine/packages/pegboard/src/actor_machine/mod.rs:900-928 \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 \u0060engine/packages/pegboard/src/actor_machine/mod.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/packages/pegboard/src/actor_machine/mod.rs:929\u0060 calls \u0060is_some\u0060, \u0060legacy_moving\u0060 and \u0060engine/packages/pegboard/src/actor_machine/mod.rs:186\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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8c70a92f3b8916abd22ad0b138f31f0ab7588994d3dcbf4bd618fce471155e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 3): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:3298-3329 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:3361-3392 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:3424-3455 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e87a0e8b8a54a91734662a620f06ccb66c4e1436552ec413112ff8eef9bb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): rivetkit-python/client/src/events/async/handle.rs:27-58 | rivetkit-python/client/src/simple/async/handle.rs:47-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/handle.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72cd7ba809d32226c55e05a2ecab7d38752a0906b6b8c674ee361a00ae8890c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): engine/packages/sqlite-embedded/src/query.rs:408-439 | engine/packages/sqlite-embedded/src/query.rs:487-518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/query.rs:408\u0060 it does not close everything it opens, so those exact 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, \u0060engine/packages/sqlite-embedded/src/query.rs:485\u0060 calls \u0060default\u0060 and \u0060engine/packages/sqlite-embedded/src/query.rs:406\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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68b61daca3cb3fa4eafd8f7dadbf41a2af35a23f7451cb04081b0811f1aea6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:478-506 | engine/packages/pegboard/src/actor_machine/mod.rs:812-840 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/actor_machine/mod.rs:478\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f307dd5b952817c50b34a40c919718cd3402d42ae916be15c3db8c3ddc3ae8d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:437-465 | rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:488-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:437\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"6427c4b79999c99c8cf820644dd3656fa5709433d0a230c953e35302762ac083"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): engine/packages/pegboard-v2-migrator/src/commands.rs:135-159 | engine/packages/pegboard-v2-migrator/src/commands.rs:183-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/commands.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7770608c8446f846f3b061f3e8b430926fe0bbde59fee0496f972d1ea1c37001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): engine/packages/util/src/throttle.rs:173-197 | engine/packages/util/src/throttle.rs:233-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/util/src/throttle.rs:173\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d9ec65b82129e282d80d233e3101d48674fb3ea0adf12727d60adfb1606725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rivetkit-python/client/src/simple/async/handle.rs:127-151 | rivetkit-python/client/src/simple/sync/handle.rs:116-140 \u2014 \u0060rivetkit-python/client/src/simple/async/handle.rs\u0060 and \u0060rivetkit-python/client/src/simple/sync/handle.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 51 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/simple/async/handle.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/simple/async/handle.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"32091cc42283d516c6eb44eb74d0e655e1ebbde65beb15736a7dac6ccb50a12f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/lib.rs:81-105 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:3348-3372 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060rivetkit-typescript/packages/rivetkit-napi/src/lib.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rivetkit-typescript/packages/rivetkit-napi/src/lib.rs:106\u0060 calls \u0060and_then\u0060, \u0060as_deref\u0060 and \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:3373\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":"rivetkit-typescript/packages/rivetkit-napi/src/lib.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3895cb7e692dd9693c90eeafd8bb905b44e978def7c7d7c00cdb5915b9c2e20b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 6): engine/packages/pegboard/src/actor_machine/mod.rs:322-344 | engine/packages/pegboard/src/actor_machine/mod.rs:544-566 | engine/packages/pegboard/src/actor_machine/mod.rs:690-712 | engine/packages/pegboard/src/actor_machine/mod.rs:869-891 | engine/packages/pegboard/src/actor_machine/mod.rs:989-1011 | engine/packages/pegboard/src/actor_machine/mod.rs:1139-1162 \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 \u0060engine/packages/pegboard/src/actor_machine/mod.rs:322\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d944f52dbe2884419b51e812644552bcc3e61c4f4c95b7965430bbc7701bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs:375-396 | engine/packages/depot-volume/src/volume_client_machine/pipeline.rs:270-293 \u2014 before extracting anything, compare \u0060engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs\u0060 and \u0060engine/packages/depot-volume/src/volume_client_machine/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs:375\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"31227e5fba3629b3af356a30d780ae3b52fb241de625b253d99248800ea98032"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs:520-543 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs:570-593 \u2014 before extracting anything, compare \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"796cba98c8ec424ed768ac05a68183673bed84f78c390985956b225ed75f5efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:198-221 | rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:320-343 \u2014 both copies are in the same file, so extract the block 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":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"458ed2eceae02f0acbc5c2c817e671ada765c8a01f997666f31eac34ae1917e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): engine/packages/api-public/src/actors/create.rs:58-80 | engine/packages/api-public/src/actors/get_or_create.rs:66-88 \u2014 before extracting anything, compare \u0060engine/packages/api-public/src/actors/create.rs\u0060 and \u0060engine/packages/api-public/src/actors/get_or_create.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060body\u0060 to \u0060CreateRequest\u0060 in one and \u0060GetOrCreateRequest\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":"engine/packages/api-public/src/actors/create.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4ce59f19319d6a7465e51cac26563dc0b47febb00e9ff7adb8f1f12bbad94f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): rivetkit-python/client/src/events/sync/handle.rs:26-45 | rivetkit-python/client/src/simple/sync/handle.rs:48-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/simple/sync/handle.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":"rivetkit-python/client/src/events/sync/handle.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d630b51919966810118cacd31ef816a30048dd0852770283eb49dda5705d37a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1649-1670 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1743-1765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1649\u0060 it does not close everything it opens, so those exact 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8abbaf8e4aed0bdd28defcffd948a011e12a21e5f5352b03d3c94430da9727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/packages/api-public/src/runner_pools/delete.rs:62-83 | engine/packages/api-public/src/runner_pools/upsert.rs:109-130 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/api-public/src/runner_pools/delete.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc7ab461c3f0c2a508961122fdb7d4c95a8e59462c901eb060c21bbacbd59df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): engine/packages/pegboard/src/legacy_backfill.rs:1515-1536 | engine/packages/pegboard/src/legacy_backfill.rs:2835-2851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/legacy_backfill.rs:1515\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278c76ff15c062e7140c3a91c5400dbfcd300976a01e8f17bce119c6d75632f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): engine/sdks/rust/envoy-client/src/actor/http.rs:871-892 | engine/sdks/rust/envoy-client/src/actor/http.rs:898-917 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/actor/http.rs:871\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor/http.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36fe3e0b643d23c575f65ff5d0f896da4d785178be9b0e8ebc670a6076a0312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:848-869 | rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:972-993 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:848\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28629ea3dee433286a917ddb1b1c8306c79566ad5741bda1f5ed21c30bded12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:1106-1127 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:245-266 \u2014 before extracting anything, compare \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs\u0060 and \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:1106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"792cec00fb9480bfcdcfae0da57d609faca6082089e4284107001574fcc00c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/session.rs:1666-1686 | engine/packages/depot-worker/src/filesystem/session.rs:1750-1768 \u2014 both copies are in the same file, so extract the block 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, \u0060engine/packages/depot-worker/src/filesystem/session.rs:1665\u0060 calls \u0060root_position\u0060, \u0060ok_or\u0060 and \u0060engine/packages/depot-worker/src/filesystem/session.rs:1749\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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"de66938fd0b45b740852c9b9228039be118a2ce9704eda413948d5f03ae0ae1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/cold.rs:315-335 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs:1460-1480 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/cold.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf9f1d3a21e1eb13fff99b093a0b672c0b202194d81aa1ebf6f1e1a2797b5b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs:727-747 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs:1332-1352 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f4df0889c7a455bb0f2d472014bd8d412db66e108817dc81d4a9bf7481d552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rivetkit-rust/packages/inspector-protocol/src/versioned.rs:65-85 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:374-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/inspector-protocol/src/versioned.rs:65\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"28acd94440b8788ad232b9fdcee6901e1c5fd3cf96cd265cf31b4c38d2ea1b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:590-610 | rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:667-686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:590\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58cd9bf6b507558e1e48bf6b103da0b6379274adff1ca151b1d5f269d8a3625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rivetkit-rust/packages/shared-types/src/actor_key/mod.rs:37-57 | rivetkit-rust/packages/shared-types/src/actor_key/slash.rs:21-41 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/shared-types/src/actor_key/slash.rs:21\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060rivetkit-rust/packages/shared-types/src/actor_key/slash.rs:17\u0060 calls \u0060is_empty\u0060, \u0060to_owned\u0060 and \u0060rivetkit-rust/packages/shared-types/src/actor_key/mod.rs:36\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":"rivetkit-rust/packages/shared-types/src/actor_key/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"242484b2c321e830ef8347c34d690d5f7f4f75ea949326f3d2f8e7e32c3460ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/packages/config/src/lib.rs:257-276 | engine/packages/config/src/lib.rs:282-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/config/src/lib.rs:257\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/lib.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e265ec29828185fc36baa5bbcd7eff71aec7ced41c77b5b434faeff4caba4d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1710-1729 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1731-1750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1710\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"463dbad16e30e4507ef99aa271eb425af93a03324be030bc6cf64d0c25d67a2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 4): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1651-1666 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1690-1708 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1719-1736 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1755-1772 \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 \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1690\u0060 it does not close everything it opens, so those exact 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, \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1737\u0060 calls \u0060clone\u0060 and \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1666\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e068eaeb589b6b8ebcec2f14b57cbc356d59e175f6b83d39979c378fccea92cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): engine/packages/engine/src/epoxy_services.rs:69-87 | engine/packages/pegboard-v2-migrator/src/services/migrator.rs:76-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060engine/packages/engine/src/epoxy_services.rs:69\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060engine/packages/engine/src/epoxy_services.rs:91\u0060 calls \u0060send_replace\u0060 and \u0060engine/packages/pegboard-v2-migrator/src/services/migrator.rs:95\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":"engine/packages/engine/src/epoxy_services.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc75d7f4495861ebe44177ec964f5bb4d5486ae05302a0067181cf36362c7af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:627-642 | engine/packages/pegboard/src/actor_machine/mod.rs:805-823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/actor_machine/mod.rs:627\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3432dfaf17389aa115205503e86a77a51fc414e62d395c512a22c46bb521461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): engine/packages/pegboard/src/index.rs:1380-1398 | engine/packages/pegboard/src/index.rs:1445-1460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/index.rs:1380\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"324a8984e7345b12c538c60cb387a67ef2b0413fe2a9b68220b002b8a5d35836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/packages/sqlite-embedded/src/query.rs:248-268 | engine/packages/sqlite-embedded/src/query.rs:317-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/query.rs:248\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acfb3d697399c950546fefaa7f4be725ef1be673d05135cc9ebe782849c9647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/packages/depot-volume/src/volume_client_machine/pipeline.rs:80-97 | engine/packages/depot-volume/src/volume_client_machine/recovery.rs:957-974 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91d8a62bddd177eadb2444a42a805ec8dda7051c76823f23cc0964e11d3b2bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): engine/packages/pegboard-envoy/src/routes.rs:354-368 | engine/packages/pegboard-envoy/src/routes.rs:396-413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard-envoy/src/routes.rs:396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/routes.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a63dc781627473d66e7fab73978991469f0d44321787a4eee068f5ef9ef81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): engine/packages/pegboard/src/index.rs:1599-1616 | engine/packages/pegboard/src/index.rs:1636-1652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/index.rs:1599\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8cc1c5cb37741bcef0d844ba8cf3f3158364ee7a4dca6aacb1eb70ee6c9361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:2148-2165 | engine/packages/sqlite-embedded/src/vfs/transport.rs:2301-2318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/vfs/transport.rs:2148\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3474ddf6df1e1117eb57cd828762900134046cec733af46ea63308ebfba443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): rivetkit-python/client/src/simple/async/handle.rs:91-107 | rivetkit-python/client/src/simple/sync/handle.rs:81-98 \u2014 \u0060rivetkit-python/client/src/simple/async/handle.rs\u0060 and \u0060rivetkit-python/client/src/simple/sync/handle.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 51 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/simple/sync/handle.rs:81\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"rivetkit-python/client/src/simple/async/handle.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac96aff84d02ac39077a9834abc09f027d3abd7b8af7d0fbc6d198d3fc44994b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rivetkit-rust/packages/client/src/handle.rs:99-116 | rivetkit-rust/packages/client/src/handle.rs:165-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 \u0060rivetkit-rust/packages/client/src/handle.rs:99\u0060 it does not close everything it opens, so those exact 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":"rivetkit-rust/packages/client/src/handle.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04bed9faaebfcac2838a79dd09a2de2d11ebde820746267e0fd52d9c8d1df69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:496-513 | rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:552-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:496\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b91813f108d7a4e2b94f436ca2b1332c1d85272d99f9050e8775f6378929bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:700-716 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:756-773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:700\u0060 it begins part-way through the construct above it, so those exact 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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"944c44b797c667bccc7e2d4cfa004e6304343cf6629ff5aeb0c573022c8ea747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:924-941 | rivetkit-rust/packages/rivetkit-core/src/actor/state.rs:1017-1031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fccc9d29bfecc3d5040ee1f261cfb5126c3d30fdef0d2193b49d0bc32cf2b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:288-305 | rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:427-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:288\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b0473fd9ac404efcdc6d04ee609bcc36690bc4ab523ad857f9eff278168bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6): rivetkit-rust/packages/actor-persist/src/versioned.rs:72-88 | rivetkit-rust/packages/client-protocol/src/versioned.rs:48-64 | rivetkit-rust/packages/client-protocol/src/versioned.rs:455-471 | rivetkit-rust/packages/client-protocol/src/versioned.rs:682-698 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:58-74 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:367-383 \u2014 before extracting anything, compare \u0060rivetkit-rust/packages/actor-persist/src/versioned.rs\u0060 and \u0060rivetkit-rust/packages/client-protocol/src/versioned.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060rivetkit-rust/packages/actor-persist/src/versioned.rs:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/actor-persist/src/versioned.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4155b06f2d1ad8c49b9e0292553ee10d419f2c5ba4c03287b0e0fd7c2129cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:647-663 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:716-732 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:780-796 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:839-855 \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 \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:647\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"1683e11ce37e28466b36ff33a139490a5c99c409430ee0bbeb48dea6e02687ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): engine/packages/pegboard/src/actor_machine/executor.rs:1416-1432 | engine/packages/pegboard/src/actor_machine/executor.rs:1482-1498 | engine/packages/pegboard/src/actor_machine/executor.rs:1901-1917 \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 \u0060engine/packages/pegboard/src/actor_machine/executor.rs:1416\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3370e9e3dc3a7e4c1f0c1af4529af9b81165a68616b563c0dcc96fb63353560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): engine/packages/depot-worker/src/tablet_coordinator_machine/state/balancing.rs:519-534 | engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/balancing.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d74f0a918356498d9854efacca24e54676d13053195ee320e8f36151aff3ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/packages/pegboard/src/catalog.rs:1025-1041 | engine/packages/pegboard/src/catalog.rs:1244-1260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/catalog.rs:1025\u0060 it begins part-way through the construct above it, so those exact 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 \u0060request\u0060 to \u0060wire::NamespaceReadRequest\u0060 in one and \u0060wire::PoolListRequest\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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54b62c47678793158ba80b2c47bc73a2e92f70cc425c0b57e1a82b4dacce6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/packages/sqlite-embedded/src/query.rs:653-669 | engine/packages/sqlite-embedded/src/query.rs:701-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/query.rs:653\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d69fb1d07a556ae0e01340d9a2f99b190d1c89df9600f3b8598b3506dc00e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): engine/packages/sqlite-embedded/src/worker.rs:1662-1678 | engine/packages/sqlite-embedded/src/worker.rs:1733-1746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/worker.rs:1662\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"132826603ffa467085b4118a3bb640535465e35bffe6bdb51061a5cc2dc740dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/packages/util/src/throttle.rs:151-167 | engine/packages/util/src/throttle.rs:207-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 \u0060engine/packages/util/src/throttle.rs:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8673776d62373a402439e4aed3cabb29daad9ae720c646f8abf601bb783cff99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/context.rs:1888-1904 | rivetkit-rust/packages/rivetkit-core/src/actor/context.rs:1940-1956 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/context.rs:1888\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccbf4d2eca2d37188340c3ee876719a74bfa8a4abb1362799b7ff9d369487ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rivetkit-rust/packages/rivetkit/src/start.rs:134-150 | rivetkit-rust/packages/rivetkit/src/start.rs:167-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 \u0060rivetkit-rust/packages/rivetkit/src/start.rs:134\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit/src/start.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c14067932834700a060fec358bbefa317ac3cf1088e53fbe7ac14c9fad6d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): engine/packages/depot-fs-core/src/txn.rs:374-388 | engine/packages/depot-fs-core/src/txn.rs:401-416 | engine/packages/depot-worker/src/filesystem/apply.rs:548-563 \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":"engine/packages/depot-fs-core/src/txn.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c3d5a146e797dd1c546f0d6ae5105c2de6ccdb1ea9ee991f3392bae0310da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/packages/depot-worker/src/tablet_coordinator_machine/mod.rs:111-126 | engine/packages/depot-worker/src/tablet_coordinator_machine/mod.rs:151-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_coordinator_machine/mod.rs:111\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f6ab34ec2ae472388d0e0eb50a53c5775a59529d5829b85e2644ffcd42211b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): rivetkit-rust/packages/engine-process/src/lib.rs:859-873 | rivetkit-rust/packages/engine-process/src/lib.rs:884-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/engine-process/src/lib.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"96122ead2c6388969b07edc478c7c8597c045585e69cd684d76a3d1f49090ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:64-79 | rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:522-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs:64\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9275763f56fe03bf12d1681266a944dd891da0a741b78f1fe2403a0cd0c64b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:241-256 | rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:363-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 \u0060rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:241\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6469ebd102436fd0369da5cec14d69666b4d0a1ac5437972c9ebb8ddbb135c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:194-207 | rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:258-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"903541dfd144fad87619cd8b092dd2bb882d7e9b3ae222e6abdb605c5236716c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/packages/depot-volume/src/ups/client.rs:238-252 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:411-425 \u2014 before extracting anything, compare \u0060engine/packages/depot-volume/src/ups/client.rs\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"engine/packages/depot-volume/src/ups/client.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d0f7da4c99120515b864cbfa3a1414c0085e8968c108994b39b2bfc0e8b193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs:2948-2962 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs:3005-3019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs:2948\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":2948}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c69dcc5efac9ff31bcfc331ad61537d4a220a83867521136d953c314650cb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/version_marks.rs:143-157 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/version_marks.rs:179-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/version_marks.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fcda72106ac32696437a817ce8f37b84e59d650769e0257084d0a6711c7d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:655-666 | engine/packages/pegboard/src/actor_machine/mod.rs:835-849 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/actor_machine/mod.rs:655\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/packages/pegboard/src/actor_machine/mod.rs:652\u0060 calls \u0060clone\u0060, \u0060stop_actor\u0060 and \u0060engine/packages/pegboard/src/actor_machine/mod.rs:833\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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c590f97379c83c98914a857d1b8e32b0fd0ae0557aac89ea8e6dfa045a062e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/packages/sqlite-prefetch/src/harness/readahead.rs:273-288 | engine/packages/sqlite-prefetch/src/harness/readahead.rs:558-573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/readahead.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d198cd00ab7922e4cbc8926bea5d3b2b7462348ab5141b540ab4dadc0ebfb7e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rivetkit-rust/packages/client/src/remote_manager.rs:349-363 | rivetkit-rust/packages/client/src/remote_manager.rs:414-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/client/src/remote_manager.rs:349\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfff5ddad085a4cbfe9ff67444bcbc82f7305303ef072b208111c768c6cdbce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:450-464 | rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:468-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sleep.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f35ab553a34ccdcce8583c76e4dbcdf621d6cdfe8fd275f201b87db2a368b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:1182-1196 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:281-295 \u2014 before extracting anything, compare \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs\u0060 and \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:1182\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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 \u0060JsSqliteProfilingConfig\u0060 in one and \u0060WasmSqliteProfilingConfig\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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b0f213a3ecbf7e5485c0108358547a29c205462798e68702bc146bb3221617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2393-2406 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2432-2445 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2472-2485 \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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2393\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6827f17fb9c2c8dc5358780739dd50e15b0dc2aaa2f9480922dd57aac2d89bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): engine/packages/pegboard/src/actor_machine/mod.rs:513-523 | engine/packages/pegboard/src/actor_machine/mod.rs:661-671 | engine/packages/pegboard/src/actor_machine/mod.rs:841-854 \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 \u0060engine/packages/pegboard/src/actor_machine/mod.rs:513\u0060 it does not close everything it opens, so those exact 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, \u0060engine/packages/pegboard/src/actor_machine/mod.rs:676\u0060 calls \u0060clone\u0060, \u0060stop_actor\u0060 and \u0060engine/packages/pegboard/src/actor_machine/mod.rs:855\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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"efeb0a2ec6956b7e1a3c8d4ac250fb3ba4a796aaf31f2806306ea5ddafc19db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/packages/depot-client/src/filesystem/txn.rs:328-341 | engine/packages/depot-client/src/filesystem/txn.rs:353-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-client/src/filesystem/txn.rs:328\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/txn.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea73c570a9fdc171305f1de921df01d07bb1477ca7a19dc3ace9a1558ed89b73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/packages/depot-client/src/volumes/slot.rs:165-185 | engine/packages/depot-client/src/volumes/slot.rs:261-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-client/src/volumes/slot.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":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a5387a64be24fd9db39886a831fe73ee31f297616ed5fcde68878f8ea44383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:308-321 | engine/packages/pegboard/src/actor_machine/mod.rs:849-862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2070635aa6b4541afb8c42b01a93a4d45b84702f3d5d17e7792687bb09d1ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): engine/packages/pegboard/src/index.rs:348-359 | engine/packages/pegboard/src/index.rs:370-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/index.rs:348\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4091dfeecd218cc9a94bb658bd6b0f91295d689daad4a58fa2e05d994d0e5a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/packages/sqlite-embedded/src/query.rs:283-296 | engine/packages/sqlite-embedded/src/query.rs:357-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 \u0060engine/packages/sqlite-embedded/src/query.rs:283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a22fd4ccf4cf7de527617cd95f6b6507336c0808fa21131b880c693674ed34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/packages/sqlite-embedded/src/query.rs:440-453 | engine/packages/sqlite-embedded/src/query.rs:523-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/query.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. 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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"51805738d0bec9bee8fa46807cace67286252ca5c478ec9c689863bfa9873891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): engine/packages/sqlite-embedded/src/worker.rs:1684-1697 | engine/packages/sqlite-embedded/src/worker.rs:1748-1758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/worker.rs:1684\u0060 it begins part-way through the construct above it, so those exact 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":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba58835ff895c7f5b8745d8dd489f3e8f4040335d47b93f0727905aa5a2b1978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/sdks/rust/envoy-client/src/actor.rs:989-1002 | engine/sdks/rust/envoy-client/src/actor.rs:1227-1240 \u2014 both copies are in the same file, so extract the block 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, \u0060engine/sdks/rust/envoy-client/src/actor.rs:1242\u0060 calls \u0060id_to_str\u0060 and \u0060engine/sdks/rust/envoy-client/src/actor.rs:1003\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":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"860b268ce1c34d059290826852aaf9ad44c18afc880bc7267f6acbc31ecd9f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/sdks/rust/envoy-client/src/handle.rs:914-927 | engine/sdks/rust/envoy-client/src/handle.rs:954-967 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/handle.rs:914\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"827c38c7cc03716e42220ffffeb6415e06f37bd4bc7aa47a7de0986cd331821a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): rivetkit-rust/packages/client/src/remote_manager.rs:745-758 | rivetkit-rust/packages/client/src/remote_manager.rs:795-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/client/src/remote_manager.rs:745\u0060 it does not close everything it opens, so those exact 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, \u0060rivetkit-rust/packages/client/src/remote_manager.rs:743\u0060 calls \u0060push\u0060, \u0060as_str\u0060 and \u0060rivetkit-rust/packages/client/src/remote_manager.rs:794\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":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e86ab4febaa3fb209509746b10ba0785b61df5b6a1ff1853ef7d34398626a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:567-580 | rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:649-662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:567\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbf5d1e795b7fede8e48f8335e89c201cdfa7af5fc0f508f49464addb40f935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1650-1662 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1718-1730 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1739-1751 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1754-1766 \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, \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1752\u0060 calls \u0060register_metric\u0060, \u0060clone\u0060 and \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1663\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81c50b0778fa77cfad2952ed7f877c5fdf68f3b2678a7e040d31a058bd721e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): engine/packages/topology/src/topology_machine/lease.rs:516-527 | engine/packages/topology/src/topology_machine/lease.rs:634-645 | engine/packages/topology/src/topology_machine/publication.rs:169-181 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b121c2bc11c82554ea121bb74576374d51cf405efdb3c5d0aad9ce2490987e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/packages/depot-client/src/filesystem/client.rs:1782-1793 | engine/packages/depot-client/src/filesystem/client.rs:1940-1952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"3524122b82868d99327cdd7fcdde5b4f9155317d150fe471008fd885e38c41e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/packages/depot-fs-core/src/keys/slatedb.rs:1106-1118 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1228-1240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-fs-core/src/keys/slatedb.rs:1106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b179ca6317a8e4c8ab1a996fbe9721cf4b4274ac04c90bbc0d72ea0fd9d2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs:145-157 | engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs:221-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs:145\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b66c1727b895d66a86b66b720487a99107d63d989f36963f2cf5580e3646c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:94-106 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair_claims.rs:153-165 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:94\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c846c49b267e38fc6c28245b2c488d9273cca851895c48949583f47e9996d37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): engine/packages/error-macros/src/lib.rs:346-379 | engine/packages/error-macros/src/lib.rs:436-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/error-macros/src/lib.rs:346\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3624b3784ec26308f0f01fdb1f4ef70f0e7d45d9f12f4bb238ccda5beaf355e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/packages/error-macros/src/lib.rs:516-527 | engine/packages/error-macros/src/lib.rs:553-565 \u2014 both copies are in the same file, so extract the block 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, \u0060engine/packages/error-macros/src/lib.rs:550\u0060 calls \u0060value\u0060 and \u0060engine/packages/error-macros/src/lib.rs:515\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":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c00a9569f39eb9d3012e01d41cecb06aea260d81c9c314130e94313be1891fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/packages/sqlite-prefetch/src/driver.rs:112-124 | engine/packages/sqlite-prefetch/src/driver.rs:147-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-prefetch/src/driver.rs:112\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/driver.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"667cb0d425635a90247491ca3b6ae46ff092d79cc6ab087648ae53a1754ec8ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/packages/topology/src/topology.rs:199-210 | engine/packages/topology/src/topology.rs:475-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fe6696a313b79c57b08054df4202f6b8946de4dac385445b847f3517b2ee88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/sdks/rust/envoy-client/src/metrics.rs:219-231 | engine/sdks/rust/envoy-client/src/metrics.rs:249-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd9b7504487ccf7f66167ee10cda82c6601405033293910811eecd1070e735e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): engine/sdks/rust/envoy-client/src/tunnel.rs:368-378 | engine/sdks/rust/envoy-client/src/tunnel.rs:398-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/tunnel.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c15b1eff00ece1e06e55feed282d4922d3694d2a0129f67c97d9ccae41fdc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs:389-401 | rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs:435-446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs:389\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d214c666348cedb85dc3e3649f5838177ceef43de90c1ab01814747b91497f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:1056-1068 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:3275-3287 \u2014 before extracting anything, compare \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs\u0060 and \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:1056\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a38edd72055cf9421816438e5b34b2fefa25c01cca3c7fa28e5e33cfd59a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): engine/packages/api-public/src/actors/create.rs:61-71 | engine/packages/api-public/src/actors/get_or_create.rs:69-79 | engine/packages/api-public/src/runner_pools/refresh_metadata.rs:75-86 \u2014 before extracting anything, compare \u0060engine/packages/api-public/src/actors/create.rs\u0060 and \u0060engine/packages/api-public/src/actors/get_or_create.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/api-public/src/actors/create.rs:61\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060query\u0060 to \u0060CreateQuery\u0060 in one and \u0060GetOrCreateQuery\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":"engine/packages/api-public/src/actors/create.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a12c40fe34a6522ad8ac2b7b7e5ac4e034616cd8a708d329c0d3a9e2d3bc03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs:525-536 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs:1481-1492 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs:575-586 \u2014 before extracting anything, compare \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fc3f3656b6f6739953c6dfa31d4ea9866f04ca98f6db61f7649ddf52673857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/packages/pegboard/src/catalog.rs:835-846 | engine/packages/pegboard/src/catalog.rs:1027-1038 | engine/packages/pegboard/src/catalog.rs:1246-1257 \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":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90c9730251caede53f93cd7479ed1003e31f0bf3ff0362940cc70c05e6462fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/cli/src/cloud.rs:286-297 | engine/packages/cli/src/cloud.rs:315-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 \u0060engine/packages/cli/src/cloud.rs:286\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060engine/packages/cli/src/cloud.rs:283\u0060 calls \u0060status\u0060, \u0060Ok\u0060 and \u0060engine/packages/cli/src/cloud.rs:314\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":"engine/packages/cli/src/cloud.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5263af74d9c285a28d3ac2427798e8dcabaed90faad622a265f5cc0c08f6f9bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): engine/packages/depot-volume/src/ups/metrics.rs:61-72 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:3489-3498 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/ups/metrics.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb103e3df1dbe52672dbb565965b9394d669bbcf118a383803d86a89e5eec8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/fork_references.rs:289-300 | engine/packages/depot-worker/src/filesystem/fork_references.rs:691-702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/fork_references.rs:289\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9fc98025337c3581bb66c60bf3f99556977450560db3549751e543d89d8f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/fork_references.rs:327-338 | engine/packages/depot-worker/src/filesystem/fork_references.rs:767-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 \u0060engine/packages/depot-worker/src/filesystem/fork_references.rs:327\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d0cc1e6d8a463dfb9d342467530a940b69785f5ee31d83b80f9f3ec7fdf0b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/fork_references.rs:371-382 | engine/packages/depot-worker/src/filesystem/fork_references.rs:647-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/fork_references.rs:371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b23d465d6de43b3e41092ac48a030149c4334351927bc9d591a43b2120cc98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/depot-worker/src/stop_requests.rs:162-173 | engine/packages/depot-worker/src/stop_requests.rs:234-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/stop_requests.rs:162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/stop_requests.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d95ce47968cf02840cd478ae9fdf4cb9e80d95ca78276286009eb5968963b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs:829-840 | engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs:852-863 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs:829\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b755210ac8ac6dd857326fdab3718c63cba64a1a1cf8e15bd9f059ad933d63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:256-267 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:309-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fbcbd2aa4283f864a3f87bf9a1a0d46df3c724005f1f14ff67dd504ed901f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:542-553 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs:770-781 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:542\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"72070288a0e7ff4bf973b7c2c70a1e9e436342110fc11a87cab64921a28302be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs:2118-2129 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs:2143-2154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs:2118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b8fb3c604c162c012f19bdf18a1f36dc6e00861e60c8a0c753a4f4eaf45409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator.rs:116-127 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/mod.rs:235-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. 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"859db73adb7e55ddec0727dbfc561ec9dfa6ae5b2419ac55134715b45ee2fb39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/engine/src/depot_peer.rs:17-28 | engine/packages/engine/src/depot_peer.rs:81-92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/engine/src/depot_peer.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine/src/depot_peer.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f86d8a9f2bad793b2214f0ebb86b3130439bdde9215b528b74bfc6e00b24d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/pegboard-gateway/src/acquire.rs:742-753 | engine/packages/pegboard/src/actor_machine/mod.rs:2922-2933 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/acquire.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bdcfb803258d9b3ded6c7721655ba97c1dd47fa7e5b17604b69240218f6a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:1712-1723 | engine/packages/pegboard/src/legacy_backfill.rs:2687-2698 \u2014 before extracting anything, compare \u0060engine/packages/pegboard/src/actor_machine/mod.rs\u0060 and \u0060engine/packages/pegboard/src/legacy_backfill.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060engine/packages/pegboard/src/actor_machine/mod.rs:1712\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d2b977b7649369036a9855b2c680573205c0978c3271d346582f658e1e7d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:3553-3564 | engine/packages/pegboard/src/namespace_machine/mod.rs:755-765 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":3553}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6324002c3e33852d407f33b10a32e1407255b7e2d9b832191a1f2ee8147d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/pegboard/src/index.rs:1233-1244 | engine/packages/pegboard/src/index.rs:1275-1286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/index.rs:1233\u0060 it does not close everything it opens, so those exact 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":"engine/packages/pegboard/src/index.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7989ac9ff61a02a173cc21015a398d811fb6fa049a8573a7532235b708f4ff37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/sqlite-prefetch/src/overflow/commit.rs:401-412 | engine/packages/sqlite-prefetch/src/overflow/commit.rs:518-529 \u2014 both copies are in the same file, so extract the block 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, \u0060engine/packages/sqlite-prefetch/src/overflow/commit.rs:530\u0060 calls \u0060extend\u0060 and \u0060engine/packages/sqlite-prefetch/src/overflow/commit.rs:413\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":"engine/packages/sqlite-prefetch/src/overflow/commit.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"522931ea533192eebab2e6297dc11b4d9867fde39fec8d85be65e1b1b586c8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/sdks/rust/envoy-client/src/actor.rs:339-350 | engine/sdks/rust/envoy-client/src/actor.rs:355-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/actor.rs:339\u0060 it begins part-way through the construct above it, so those exact 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":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a847aa368f115464bdec16198d4450fc3620a150eca465c8b976eba0a87b43f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs:85-96 | rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs:213-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 \u0060rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs:85\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29905c900d9980b9efce6954a87063a45df94d2e0ee66e3c5558ac63d67c5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs:157-168 | rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs:537-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs:157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba05de13ce23aa57b6067a831a7e92c22396563cb61a043ba3ee01d49dca151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/kv.rs:63-74 | rivetkit-typescript/packages/rivetkit-napi/src/kv.rs:85-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 \u0060rivetkit-typescript/packages/rivetkit-napi/src/kv.rs:63\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/kv.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e216107088b20184a480c538ccba9d2c4973b04938cf0df2d76aa8247eee1f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:919-929 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:918-928 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:941-951 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:979-989 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:968-978 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:968-978 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:919\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v2::EnvoyData\u0060 in one and \u0060pegboard_actor_v3::EnvoyData\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1ffb645efba26618be1ea98faa94bd2fb4bf01d1beeaaa21f3a15f99854f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): rivetkit-rust/packages/actor-persist/src/versioned.rs:81-91 | rivetkit-rust/packages/actor-persist/src/versioned.rs:439-449 | rivetkit-rust/packages/client-protocol/src/versioned.rs:57-67 | rivetkit-rust/packages/client-protocol/src/versioned.rs:464-474 | rivetkit-rust/packages/client-protocol/src/versioned.rs:572-582 \u2014 before extracting anything, compare \u0060rivetkit-rust/packages/actor-persist/src/versioned.rs\u0060 and \u0060rivetkit-rust/packages/client-protocol/src/versioned.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060rivetkit-rust/packages/actor-persist/src/versioned.rs:81\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/actor-persist/src/versioned.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b81e1fbd7a21aeb1635bcf4e260cbc40d15d225b64e002f394bd852ad1db180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): engine/sdks/rust/envoy-client/src/tunnel.rs:366-376 | engine/sdks/rust/envoy-client/src/tunnel.rs:396-406 | engine/sdks/rust/envoy-client/src/tunnel.rs:678-687 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a03bf6045d0a0e1ead2405d0da033f9d878f8364e69bb859c65ea0dbf8f93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-client/src/filesystem/client.rs:1501-1511 | engine/packages/depot-client/src/filesystem/client.rs:1714-1724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-client/src/filesystem/client.rs:1501\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5463430ae816dc8d4229a85bd944e2546b9988d0e231a1c3a67ed64f848f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-volume/src/ups/client.rs:93-103 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:270-280 \u2014 before extracting anything, compare \u0060engine/packages/depot-volume/src/ups/client.rs\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-volume/src/ups/client.rs:93\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/ups/client.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dea63748a87f0b8479c72e4362575e843c2879ad09a12677730f17eee5bda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/fork_references.rs:1038-1048 | engine/packages/depot-worker/src/filesystem/fork_references.rs:1064-1074 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/fork_references.rs:1038\u0060 it does not close everything it opens, so those exact 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 \u0060spec\u0060 to \u0060\u0026FsForkSpec\u0060 in one and \u0060FsForkSpec\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":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e25592d71e611a9f0359e6be59e7b16297649640d1bbaa39879797e5d86739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/forks.rs:399-409 | engine/packages/depot-worker/src/filesystem/forks.rs:622-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/forks.rs:399\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae30420cd82193c575220b89fcc4ac82c132c9bf05164eb5cb5206fa0bc94e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/forks.rs:394-403 | engine/packages/depot-worker/src/filesystem/forks.rs:508-518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/forks.rs:394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd403242c223520028665e712ace65c2e4fa9707bded1b5b920edecba2c46a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/forks.rs:531-541 | engine/packages/depot-worker/src/filesystem/forks.rs:690-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/forks.rs:531\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd4bee3f0423260775cad7f407e005b61ef2f7373153a742bf4fb491d81569a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/session.rs:774-784 | engine/packages/depot-worker/src/filesystem/session.rs:820-830 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/session.rs:774\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8ddc6316c845a8f1d0ae8bc153bd8f4c97833e7305b84fc30e51e368c7975a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-worker/src/stop_requests.rs:189-199 | engine/packages/depot-worker/src/stop_requests.rs:225-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/stop_requests.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5d2990f607d3ab5872695528116b2f726483c6f15b1ece6f2d0e6c727e446f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs:930-940 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs:943-953 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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, \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs:941\u0060 calls \u0060VolumeSeqGap\u0060, \u0060Diverged\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs:929\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"180fc2c2803e5a9496638d6866c29dd0c9b5df36a0d1f5b699944972a3b2c26e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:553-563 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:633-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ffc04adf61fc09c26d5c9b518e30f0d224e43fa15fe119a847c73177ec05b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/depot-worker/src/tablet_supervisor.rs:2150-2160 | engine/packages/depot-worker/src/tablet_supervisor.rs:2195-2205 \u2014 both copies are in the same file, so extract the block 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":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b8e7e7ec51ad8bba1f41b7c3fca46b52af131d1599b3cb77bc7509089cbac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/error-macros/src/lib.rs:78-88 | engine/packages/error-macros/src/lib.rs:178-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/error-macros/src/lib.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cb65b91195896e2239488911e95f1dfc6fc110efaba1eaec36db24e77a601a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/pegboard-gateway/src/routes.rs:315-325 | engine/packages/pegboard-gateway/src/routes.rs:598-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard-gateway/src/routes.rs:315\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cada8098f9d50678dfcf405fb6076be322d8fd62f61b859f4692d37646d146eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/sqlite-embedded/src/query.rs:282-292 | engine/packages/sqlite-embedded/src/query.rs:439-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/query.rs:282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/packages/sqlite-embedded/src/query.rs:278\u0060 calls \u0060Some\u0060, \u0060bind_params\u0060 and \u0060engine/packages/sqlite-embedded/src/query.rs:438\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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7173e97fbc2413ebd303d203171a6e1d930505a6a159c97060e1b0b07d2d73e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:2090-2100 | engine/packages/sqlite-embedded/src/vfs/transport.rs:2245-2255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/vfs/transport.rs:2090\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bca6474a3aaaa5432e0f8dbda4e19c6aa2dbaa1de9445d4709b7a3f74a23a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/sqlite-prefetch/src/prefetcher.rs:455-465 | engine/packages/sqlite-prefetch/src/prefetcher.rs:724-734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-prefetch/src/prefetcher.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":"engine/packages/sqlite-prefetch/src/prefetcher.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10799e90342ea9dacafd10ede1e86a10107609d20308ec7675ab960c47c2d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/topology/src/topology_machine/lookup.rs:464-474 | engine/packages/topology/src/topology_machine/lookup.rs:514-524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/topology/src/topology_machine/lookup.rs:464\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lookup.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f21f1f56f8d7189a0a29020f3fea6855cc4a5423ff727a92d1f48a2fbc61438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/sdks/rust/envoy-client/src/handle.rs:929-939 | engine/sdks/rust/envoy-client/src/handle.rs:969-979 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/handle.rs:929\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"149b5fb602c0067f9c88c6f3ffa3abd226f91d62ce52141ce40fceef939d4eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/sdks/rust/envoy-client/src/sqlite.rs:559-569 | engine/sdks/rust/envoy-client/src/sqlite.rs:599-609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/sqlite.rs:559\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/sqlite.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5604a1288ca9916674cc8c4c8c263f19ed0b8012cc61d09169c252d43820ce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rivetkit-python/client/src/events/async/handle.rs:70-79 | rivetkit-python/client/src/events/sync/handle.rs:50-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/events/sync/handle.rs:50\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"rivetkit-python/client/src/events/async/handle.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f526d9e89731a02a1e9c6f508f15d1eb04adb6420127dff0f47aca64819aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:351-361 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:460-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6507e60c1f543fc770fa949e1c44285b61c0bc478379fe1a9b1babcb98abfad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:638-648 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:658-668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61cb662557bf1ba81ebe51b6261c677b116f100176349102b5dbf21800d5735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:93-103 | rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:142-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a193da562208e2ab5df7634fe8dfc99d18dcda8105ea1229103ba9630a8bc231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/sdks/rust/envoy-client/src/tunnel.rs:366-375 | engine/sdks/rust/envoy-client/src/tunnel.rs:396-405 | engine/sdks/rust/envoy-client/src/tunnel.rs:623-632 | engine/sdks/rust/envoy-client/src/tunnel.rs:678-687 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1d896c2f08a3f5354e7f6db849545c648ed08946ace49cdaab47498995716a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 4): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1168-1174 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1178-1184 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1669-1675 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1747-1756 \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 \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1747\u0060 it begins part-way through the construct above it, so those exact 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, \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1667\u0060 calls \u0060register_metric\u0060, \u0060clone\u0060 and \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1747\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a166c84b5ab5e85df33ac3d77bc6830a1f392fd5bae06621b7b5bd201b80dc11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs:381-389 | engine/packages/depot-volume/src/volume_client_machine/pipeline.rs:278-286 | engine/packages/depot-volume/src/volume_client_machine/repair.rs:150-159 \u2014 before extracting anything, compare \u0060engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs\u0060 and \u0060engine/packages/depot-volume/src/volume_client_machine/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-volume/src/volume_client_machine/repair.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":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b39b302715738aaf6973ba90af18540dc0aee1a56e3e8aaa6ef0af9a7739f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): engine/packages/depot-worker/src/stop_requests.rs:152-160 | engine/packages/depot-worker/src/stop_requests.rs:188-197 | engine/packages/depot-worker/src/stop_requests.rs:224-233 \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 \u0060engine/packages/depot-worker/src/stop_requests.rs:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/stop_requests.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c92c5f759af584ffbb323b0e2564a83dec4656b01a740e487f7503f291ebe97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/packages/error-macros/src/lib.rs:76-85 | engine/packages/error-macros/src/lib.rs:176-185 | engine/packages/error-macros/src/lib.rs:209-218 \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 \u0060engine/packages/error-macros/src/lib.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":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62c6fef485823ed1a01a474d1e9b6e620b6fc0dc9c375dffb4d9be94555702c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1175-1181 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1648-1656 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1751-1760 \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 \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1648\u0060 it does not close everything it opens, so those exact 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7305b1fb117b1c39b8418d3b9005b5e24406e9ea405b8a3300be7758d815bc8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/api-public-shim/src/lib.rs:278-287 | engine/packages/pegboard-gateway/src/lib.rs:131-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/api-public-shim/src/lib.rs:278\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public-shim/src/lib.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"534bb6e7f09d9f89d5ed711943074c65c481ebaf3f8bea40bf6e79ecbfc8effe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): engine/packages/api-public/src/actors/reschedule.rs:48-57 | engine/packages/api-public/src/actors/sleep.rs:48-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/api-public/src/actors/reschedule.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":"engine/packages/api-public/src/actors/reschedule.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a101f5cf5e5496c980a6ee52c6ff1b4fbe4e2328be0b974bf2852502385e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): engine/packages/depot-log/src/log_shard_machine/state/reads.rs:46-54 | engine/packages/depot-log/src/log_shard_machine/state/reads.rs:113-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-log/src/log_shard_machine/state/reads.rs:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/reads.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b218e59ffec7c5a701251c198e669a6435afc2258dc48c63c3400066280edd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/fork_reads.rs:225-234 | engine/packages/depot-worker/src/filesystem/session.rs:2044-2053 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/depot-worker/src/filesystem/fork_reads.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a260f9313d9295f0a1843e734d0af263e5d884efdc412ed3e697f00b331ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/fork_references.rs:398-407 | engine/packages/depot-worker/src/filesystem/fork_references.rs:665-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/fork_references.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fa93ec5368a0be924690be55a8fd7f2ae4576b10aaa38af4baff867ad6cef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/read.rs:246-253 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:190-199 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:190\u0060 it begins part-way through the construct above it, so those exact 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":"engine/packages/depot-worker/src/filesystem/read.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"818a5024e067d734a5bc259ceda1f4a36255789699179423e6544a882835d683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs:818-827 | engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs:842-850 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_coordinator_machine/runner.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":"engine/packages/depot-worker/src/tablet_coordinator_machine/runner.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5d6cd3f10b799d52cc37575bebf365b6fe7490f88089f8608579002c5fdca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/depot-worker/src/tablet_coordinator_machine/state/split.rs:247-256 | engine/packages/depot-worker/src/tablet_coordinator_machine/state/versions.rs:28-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_coordinator_machine/state/split.rs:247\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060report\u0060 to \u0060\u0026ParentLogImported\u0060 in one and \u0060\u0026VersionMarksReport\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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/split.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b39f78f1742406e9fbe964f42657e95b27e5834e9cd754f2ab4d7ec28281ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:404-413 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:427-436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:403\u0060 calls \u0060begin_pass\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:426\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13dcab59a83097dbacc3f2f40cbd468b4cf1feed15d4a36347c95fedd5aa5bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/engine/src/depot_command/health.rs:96-105 | engine/packages/engine/src/depot_command/health.rs:143-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine/src/depot_command/health.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdbf6474c2193d77b1b292e402425c9721f1286af9604470d660d8e2675b2f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/pegboard-v2-migrator/src/operator.rs:24-33 | engine/packages/pegboard-v2-migrator/src/operator.rs:124-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/operator.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"567f2f61cd1d59191fc715e6fd44be1b4f783beec4ec320d912edce6c48febce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:2691-2700 | engine/packages/pegboard/src/legacy_backfill.rs:1740-1749 \u2014 before extracting anything, compare \u0060engine/packages/pegboard/src/actor_machine/mod.rs\u0060 and \u0060engine/packages/pegboard/src/legacy_backfill.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a0785d120cf26e92b579738d8b08eef595d3c9ef7ee24966b90dc79f6c5f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): engine/packages/sqlite-embedded/src/pager_cache.rs:491-498 | engine/packages/sqlite-embedded/src/pager_cache.rs:538-547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/pager_cache.rs:491\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/pager_cache.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a449366981a782baa214e513a92e5049c80820a07dea392a0dc7ae147c4009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:2167-2176 | engine/packages/sqlite-embedded/src/vfs/transport.rs:2320-2329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/vfs/transport.rs:2167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4388b1264dad486c84f03dcabd3458789d1985f38a3b7d32cd9138437104d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:2181-2191 | engine/packages/sqlite-embedded/src/vfs/transport.rs:2335-2345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed712de77a2be8abd655419780a95dd90cde723669735ccef54e1c29ccad0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:3887-3896 | engine/packages/sqlite-prefetch/src/harness/vfs.rs:408-417 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":3887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0832783cc7470e02d839690215412fd90941949560016738114a4f27157c7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/topology/src/topology_machine/publication.rs:200-209 | engine/packages/topology/src/topology_machine/publication.rs:233-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/topology/src/topology_machine/publication.rs:200\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/publication.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3926c08abc3903c799a477ca81b409a8c3152d26b4db30974960fa731d0c5122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v1_to_pegboard_v2_migrator_v2.rs:24-33 | engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v2_to_pegboard_v2_migrator_v1.rs:34-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v1_to_pegboard_v2_migrator_v2.rs:24\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/pegboard_v2_migrator_v1_to_pegboard_v2_migrator_v2.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e27f8b9d7c7811ad8020015da76d00266309e859a2452de72d7aa3318e998e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/sdks/rust/data/src/versioned/topology_worker_heartbeat.rs:67-76 | engine/sdks/rust/data/src/versioned/topology_worker_heartbeat.rs:86-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060topology_worker_heartbeat_v1::Data\u0060 in one and \u0060topology_worker_heartbeat_v2::Heartbeat\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":"engine/sdks/rust/data/src/versioned/topology_worker_heartbeat.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc7c56220fcb35af3a22d019d49bd53d445eac04ce2c9e32069db710f090a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:126-135 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:150-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:126\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9d8e342319788281f29f09c8580c11f014899c723fc8c251cfef23e24c266e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1712-1721 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:1727-1736 \u2014 both copies are in the same file, so extract the block 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 \u0060result\u0060 to \u0060protocol::SqliteQueryResult\u0060 in one and \u0060protocol::SqliteExecuteResult\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":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbecaacb653a702e7da7000c2a38155e258bbd691f8b73b43a11a8ab9a95820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:1023-1032 | rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:1067-1076 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:1023\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:1020\u0060 calls \u0060Ok\u0060 and \u0060rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:1066\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":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2503f05812a0bf535336fa47e93b4e013316cd79a708b39f2bb25258dd48cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1842-1850 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1875-1883 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1911-1919 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1944-1952 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2020-2028 \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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1842\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"137f90379db342ae1bcc97e1900cd6ce622849a5028a62a8c8f952b3da6b3021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1865-1873 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1898-1906 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1934-1942 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1967-1975 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2049-2057 \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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1865\u0060 it begins part-way through the construct above it, so those exact 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, \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1977\u0060 calls \u0060clone\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1875\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ef62158e5f16e38ba90d09f970c29f84b0b4059a7c74b2f7f00199196badf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/sdks/rust/envoy-client/src/connection/wasm.rs:352-360 | engine/sdks/rust/envoy-client/src/utils.rs:122-130 | rivetkit-rust/packages/rivetkit-core/src/lib.rs:74-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/connection/wasm.rs:352\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/connection/wasm.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d84b79ce23bc68f336fb157eb23695daee0643666c6a79b61d4292b29c2e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/api-public-shim/src/routes.rs:1121-1129 | engine/packages/api-public-shim/src/routes.rs:1491-1499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/api-public-shim/src/routes.rs:1121\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public-shim/src/routes.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb3df1e2f81b8da2ca90fcf643653344bf5a907093504f8944b238515d4ff54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): engine/packages/cli/src/auth.rs:191-199 | engine/packages/cli/src/auth.rs:245-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/auth.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f149c835c8f300d531ef267b83255d476e54c7d350dd597a751f2e06fa7bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/depot-client/src/volumes/slot.rs:478-486 | engine/packages/depot-client/src/volumes/slot.rs:742-750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/volumes/slot.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb458aa30f98fe78e0d37bb3cfc8860fa5f968333b239ac6c8f14ad647a67de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/depot-volume/src/volume_client_machine/executor/recovery.rs:147-159 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:862-870 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060engine/packages/depot-volume/src/volume_client_machine/executor/recovery.rs:147\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060engine/packages/depot-volume/src/volume_client_machine/runner.rs:859\u0060 calls \u0060Some\u0060, \u0060take\u0060, \u0060clear\u0060 and \u0060engine/packages/depot-volume/src/volume_client_machine/executor/recovery.rs:146\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":"engine/packages/depot-volume/src/volume_client_machine/executor/recovery.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d32c886f6c84bf8d783e6bdf7db8aacd46193aaa3cccf17830af6b146bc295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs:514-522 | engine/packages/depot-volume/src/volume_client_machine/pipeline.rs:883-891 \u2014 before extracting anything, compare \u0060engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs\u0060 and \u0060engine/packages/depot-volume/src/volume_client_machine/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/lifecycle.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"172ec757092437c995a02e5d2b9c043242a0da519154deb181c683ab16d709be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): engine/packages/depot-volume/src/volume_client_machine/membership.rs:166-173 | engine/packages/depot-volume/src/volume_client_machine/repair.rs:65-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-volume/src/volume_client_machine/membership.rs:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/membership.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe13b5201b21ba331437487b456dd728d96c04aaadb3a99dd72a44e89dc9169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/read.rs:439-447 | engine/packages/depot-worker/src/filesystem/read.rs:508-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/read.rs:439\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/read.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4e2de598e8508fab458d748ed47aa09e8cd9cd7e809636245e14500404f665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:215-224 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:239-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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:215\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a0aff1aea2787e7bc89f903cdd86f85253b5d5dd01fa3decbae180a4c509df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:399-405 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:416-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs:399\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem_reads.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6f7a322eb6d47af0add5c6fa209433295213a103ee6b7b81e49549061e8fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_cleanup.rs:149-157 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_cleanup.rs:165-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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_cleanup.rs:149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_cleanup.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f54b1d2f08149088900ee0149fb1918ef5723166f14dadf4590b895fe6000d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs:1354-1362 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs:889-897 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70045bb276dbc7f1578b5d9de7cc72369530b025179a6db824086acffec9efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): engine/packages/env/src/backends/production/clock.rs:112-120 | engine/packages/env/src/backends/production/clock.rs:170-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 \u0060engine/packages/env/src/backends/production/clock.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/backends/production/clock.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d618c8c97ad4ebd813915401acb6f79b5db7a97003a92106b9d28fdead0c8587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/pegboard-gateway/src/websocket_tunnel.rs:175-183 | engine/packages/pegboard-gateway/src/websocket_tunnel.rs:229-237 \u2014 both copies are in the same file, so extract the block 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":"engine/packages/pegboard-gateway/src/websocket_tunnel.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5234bc8f05bbe5b0f82d6efc83545a4adf482db6e138b6092f80e47c59d9586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:3850-3858 | engine/packages/sqlite-prefetch/src/harness/vfs.rs:384-392 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":3850}}}],"partialFingerprints":{"codehealthFindingId/v1":"259950a9135e72ab2b5ec844581392687277f88eb3048d701db192850c9830d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): engine/sdks/rust/envoy-client/src/stringify.rs:79-87 | engine/sdks/rust/envoy-client/src/stringify.rs:147-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/stringify.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/stringify.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c904307444218675aa6721d65debd867713e030ddedaa22013d6b5e67b8a2c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): rivetkit-python/client/src/util.rs:183-189 | rivetkit-python/client/src/util.rs:221-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 \u0060rivetkit-python/client/src/util.rs:183\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/util.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87de77ca021db5e9f5e1736cc3ba5666292107c60764366fb940e32c610660c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rivetkit-rust/packages/client/src/remote_manager.rs:328-336 | rivetkit-rust/packages/client/src/remote_manager.rs:393-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb497a45c09025ae012cb1b77ca23ee830788c59fe21ebb1b3b92322b27997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rivetkit-rust/packages/client/src/remote_manager.rs:766-774 | rivetkit-rust/packages/client/src/remote_manager.rs:810-818 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/client/src/remote_manager.rs:766\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a120b5619a570a914e646b098bc385f696fee4724f4762f9e8a0ba0e44e216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:419-427 | rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:472-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs:419\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/queue.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c712c91b8ee4f9e6229d9e9c4234a598788ba8c0432ab564b4419c3f868596e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:872-880 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:896-904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:872\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:893\u0060 calls \u0060Some\u0060, \u0060set_anyhow\u0060, \u0060from_str\u0060 and \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:871\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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"2653dd670510952ad616942db125be27ca3b37361e36ccb28d2282d21312f42b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1070-1078 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1184-1192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1070\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"3907e533326174143487bc3a8a4e118ce7b427b2ab64b55809d702d80a1d56d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1714-1721 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1760-1767 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1846-1853 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1879-1886 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1915-1922 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1948-1955 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2024-2031 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1714\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1712\u0060 calls \u0060clone\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1758\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7a6b9e3232d01e3f8686df4ebc31ebb9a61e8949964ebb8add74e953333138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): engine/packages/depot-volume/src/volume_client_machine/runner.rs:459-466 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:607-614 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:632-639 | engine/packages/depot-volume/src/volume_client_machine/runner.rs:655-662 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/runner.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff30f2d238a52006f009dfa9780cef5d3726cd4f108fc28c01d9aeb909d8772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): engine/packages/sqlite-embedded/src/pager_cache.rs:577-584 | engine/packages/sqlite-embedded/src/pager_cache.rs:611-618 | engine/packages/sqlite-embedded/src/pager_cache.rs:640-647 | engine/packages/sqlite-embedded/src/pager_cache.rs:690-697 \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 \u0060engine/packages/sqlite-embedded/src/pager_cache.rs:577\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/pager_cache.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f062c24ec1b08c65133786fd24360616115e7d3e6cd4ff9df3340cecb7c4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): engine/packages/depot-client/src/filesystem/client.rs:1766-1773 | engine/packages/depot-client/src/filesystem/transaction.rs:433-439 | engine/packages/depot-client/src/filesystem/txn.rs:95-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-client/src/filesystem/client.rs:1766\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a52539e2b7bcf8a04b031a50aa2f6a667a3242b8632a69bff055b0e2a3a458d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs:536-543 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs:747-754 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs:586-593 \u2014 before extracting anything, compare \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/footprint.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2954bac44430d3d0129b2519d1045c43db271c0231fe93cebe1113c4cbc244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/packages/guard-core/src/response_body.rs:138-149 | engine/packages/guard-core/src/response_body.rs:151-162 | engine/packages/guard-core/src/response_body.rs:164-175 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/guard-core/src/response_body.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafea183f55e36b003376ebd74b1445b2994522cf94caa48704d57d5043230e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/auth-jwt/src/key_ring_machine/executor.rs:55-62 | engine/packages/cluster-config/src/cluster_config_machine/executor.rs:69-76 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060engine/packages/cluster-config/src/cluster_config_machine/executor.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. 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":"engine/packages/auth-jwt/src/key_ring_machine/executor.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be9d2244cf13bf45f2e88541ac33559ce61080a855b2344031032384deadb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-volume/src/volume_client_machine/membership.rs:59-66 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/membership.rs:67-74 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060engine/packages/depot-volume/src/volume_client_machine/membership.rs:59\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/membership.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ef62ac1554897cbba042cc4a8653c1cefc53358fafa0369e304504e967d809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-volume/src/volume_client_machine/recovery.rs:279-286 | engine/packages/depot-volume/src/volume_client_machine/recovery.rs:875-882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab19d4369f47c8065c9edf6eb33f07c34639822d6bb22195f8fca83264042ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/checkpoints.rs:249-256 | engine/packages/depot-worker/src/filesystem/checkpoints.rs:259-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/checkpoints.rs:249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9815e11bd1ed5f2e9a519c16fddabd2f7a9c74e4311b786afb6ad881f76eb9dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/checkpoints.rs:485-492 | engine/packages/depot-worker/src/filesystem/checkpoints.rs:987-994 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/checkpoints.rs:485\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea868c3119913818d0e7890268c776564e54cdba3ccfdb4b7de79b6ea087d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/store.rs:1036-1043 | engine/packages/depot-worker/src/filesystem/store.rs:1193-1200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/store.rs:1036\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"661e3c79e6d83a74e418c535ab0f438dec10f1dcabb88091b54b10d160b1a2ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:496-503 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs:724-731 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs:496\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b9419537d8c99841e5ad5e32ec2a74c7a2df169e02314fc6dc2e06ce78e102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:1100-1107 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs:631-638 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:1100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ff5cdb7d7be96e0b5f8f93f1b5cd48d6a0a87c4ad552d58afbd09a3e6b5ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/env/src/backends/production/fs.rs:241-248 | engine/packages/env/src/backends/production/slatedb.rs:290-297 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/env/src/backends/production/fs.rs:241\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/backends/production/fs.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f71eea99431fb76453833beccdc8585aecf5bf16f5edba0aad4d2a6a458274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:2653-2660 | engine/packages/pegboard/src/commands.rs:530-537 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dc2767e1383c9e491f55ca4a6d6998afc8e5c14dbc70f5feeeede14d9ef7ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/pegboard/src/namespace_machine/mod.rs:1232-1239 | engine/packages/pegboard/src/namespace_machine/mod.rs:1270-1277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/namespace_machine/mod.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75b3e0e62fbf80a0ab66c668c38c143a46bfc0700161b575720ffb7a5a1db8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/util/src/async_counter.rs:17-24 | engine/sdks/rust/envoy-client/src/async_counter.rs:26-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/async_counter.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b15c6ed81274bbf109be8d3bd3005c5a8a157ca03f8f1e314c1a5b223c9b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): engine/sdks/rust/envoy-client/src/tunnel.rs:819-826 | engine/sdks/rust/envoy-client/src/tunnel.rs:842-847 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/tunnel.rs:819\u0060 it does not close everything it opens, so those exact 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":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"759521f39cea8c8008ae0728267923133ccefff3436bc9acdb123fba6227bb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-python/client/src/events/async/client.rs:43-50 | rivetkit-python/client/src/simple/async/client.rs:43-50 \u2014 before extracting anything, compare \u0060rivetkit-python/client/src/events/async/client.rs\u0060 and \u0060rivetkit-python/client/src/simple/async/client.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/events/async/client.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/client.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eba74b566d192b8e89eb0f954a83b583d2fcf542e34fe4d555c3cbe5a3837a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-python/client/src/events/async/client.rs:64-71 | rivetkit-python/client/src/simple/async/client.rs:62-69 \u2014 before extracting anything, compare \u0060rivetkit-python/client/src/events/async/client.rs\u0060 and \u0060rivetkit-python/client/src/simple/async/client.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/events/async/client.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":"rivetkit-python/client/src/events/async/client.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fc6dfbe1d83a438bedb35c492880e1cbf10038a91a4ba660f8a4d969e876bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-python/client/src/events/async/client.rs:85-92 | rivetkit-python/client/src/simple/async/client.rs:81-88 \u2014 before extracting anything, compare \u0060rivetkit-python/client/src/events/async/client.rs\u0060 and \u0060rivetkit-python/client/src/simple/async/client.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/events/async/client.rs:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/client.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff2881a4d43e8ed4bf577b6f2c2c8fc20a91970120f538aacb58f556bb4cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-rust/packages/client/src/protocol/codec.rs:135-142 | rivetkit-rust/packages/client/src/protocol/codec.rs:145-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 \u0060rivetkit-rust/packages/client/src/protocol/codec.rs:135\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/protocol/codec.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eedaf313d58c11d833398922b25acdee3b755bb7acb80a2da7c3a880515a3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs:593-600 | rivetkit-rust/packages/rivetkit-core/src/actor/sleep.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":"rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc32a3c78dba91c39e66db56dc648b434aa0f380915ddd0639b95603d6194e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/inspector_ws.rs:181-188 | rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs:650-657 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/registry/inspector_ws.rs:181\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector_ws.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92725759f00441a82a3a785051472748de53d638bba48b0319558ac49f74dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:348-357 | rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs:407-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060response\u0060 to \u0060ApplicationResponse\u0060 in one and \u0060ServerlessResponse\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":"rivetkit-rust/packages/rivetkit-core/src/serverless_http.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81f3d1b17236470e7e042c6a05df7949b8c2821620df4843b17e8e9a4b9578e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:495-502 | rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:540-547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-typescript/packages/rivetkit-napi/src/registry.rs:495\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/registry.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"765ea62f424fe097982e38105940cffb9c5c5b65c3d37ce7c631bced7e4a09fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1609-1615 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1842-1848 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1875-1881 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1911-1917 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1944-1950 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2020-2026 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1839\u0060 calls \u0060observe\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1608\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86575425bc7344358dd9d1fc09cac9bfc8fb0941a76000f77302e59123277e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): engine/packages/depot-fs-core/src/keys/slatedb.rs:886-893 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1113-1120 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1200-1207 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1235-1242 \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 \u0060engine/packages/depot-fs-core/src/keys/slatedb.rs:886\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5b2bf342968c5a3faad80624bbe3d19aa4761cdf8177010cbdb0b3d245d3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/packages/pegboard-envoy/src/connection.rs:1243-1249 | engine/packages/pegboard-envoy/src/connection.rs:1533-1539 | engine/packages/pegboard-envoy/src/connection/inbound.rs:62-68 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a546ff85259b0a57becb44551080f853e1c74e06b86b16f1586351b5777566c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/packages/pegboard-envoy/src/routes.rs:275-281 | engine/packages/pegboard-gateway/src/routes.rs:998-1004 | engine/packages/pegboard-gateway/src/routes.rs:1392-1398 \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 \u0060engine/packages/pegboard-envoy/src/routes.rs:275\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ws\u0060 to \u0060WebSocketUpgrade\u0060 in one and \u0060Result\u003CWebSocketUpgrade, WebSocketUpgradeRejection\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":"engine/packages/pegboard-envoy/src/routes.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1550fd635f66a85941667fc23bae327f9a6bbca79edd7bc74b68402fea7bd26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/packages/sqlite-embedded/src/vfs/transport.rs:1413-1419 | engine/packages/sqlite-embedded/src/vfs/transport.rs:2184-2190 | engine/packages/sqlite-embedded/src/vfs/transport.rs:2338-2344 \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":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b6fe1185fd65ab0a80e99c4f76cf703471dcd05944dcb9f9e8c7a18f8ccb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-fs-core/src/keys/slatedb.rs:1199-1205 | engine/packages/depot-fs-core/src/keys/slatedb.rs:1327-1333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-fs-core/src/keys/slatedb.rs:1199\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/keys/slatedb.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e83daa3cc3a61b925a8d8b9a1706711fc02e5ed8174852c554a96249d42b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-volume/src/volume_client_machine/membership.rs:22-28 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/membership.rs:34-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/membership.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b52854b90f2543c0766580e9f58b50c2d408557295985fc1484ead9f46821c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/alarm_bootstrap.rs:111-117 | engine/packages/depot-worker/src/filesystem/alarm_bootstrap.rs:210-216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/alarm_bootstrap.rs:111\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/alarm_bootstrap.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edc6973ffa5d144c74f370eece469cf79da1723018e62ac946ab0740d5c2537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/checkpoints.rs:403-412 | engine/packages/depot-worker/src/filesystem/checkpoints.rs:932-941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/checkpoints.rs:403\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc74a5ab6ecf4eed363f368b3ed938c19756203856b3a6e3d18545cb61c2bc77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/forks.rs:207-213 | engine/packages/depot-worker/src/filesystem/forks.rs:231-237 \u2014 both copies are in the same file, so extract the block 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":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4924e21894c11763c0f2db13023b74e29370152f7a20cb7794861a49a4cda435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-worker/src/services/coordinator.rs:68-74 | engine/packages/depot-worker/src/services/log_shard.rs:80-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/depot-worker/src/services/coordinator.rs:68\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/services/coordinator.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c782d5becd4c71b97814b80379b6eae1cffd7368b64cf8751120d2c13ab4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:359-365 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:380-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs:359\u0060 it does not close everything it opens, so those exact 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/cold_store.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"74135e394f22bd3b5ca9aad56cb692a55d9e45f2c26bfa4222983754b4bffce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs:1251-1257 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs:1627-1633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7daa45d7ebd56a6faab8f8be19c7db8e69141cf5eee014660ee2d4974cda97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs:409-415 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs:531-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs:409\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfcf80da2f112060d1d76ef782f69e81ff40a0d098f99df702de5ce19d47437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:2496-2502 | engine/packages/pegboard/src/legacy_backfill.rs:1362-1368 \u2014 before extracting anything, compare \u0060engine/packages/pegboard/src/actor_machine/mod.rs\u0060 and \u0060engine/packages/pegboard/src/legacy_backfill.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2496}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c297362e43a92cd158adff4a09fe44256863cc6ede59f76d5ef57e3545abe6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/pegboard/src/commands.rs:230-236 | engine/packages/pegboard/src/commands.rs:292-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/commands.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060wire::ActorCreateRequest\u0060 in one and \u0060wire::MigrateFromV2Begin\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":"engine/packages/pegboard/src/commands.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"917f4ca19eaa536d206dc1ff7bab4cf0220aa7556f04598af7f8c99ee5491319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): engine/packages/pegboard/src/commands.rs:519-524 | engine/packages/pegboard/src/commands.rs:541-547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/commands.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55d00d21383340299f3e62406d1b19b12ad366b1b2dc6af2f7d343b57bf7317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/pegboard/src/legacy_backfill.rs:1708-1714 | engine/packages/pegboard/src/legacy_volumes.rs:339-345 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c534be70986e2e7496c900f859f0bad0a05b678dbd70e088735ac59665b939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/sqlite-embedded/src/query.rs:400-406 | engine/packages/sqlite-embedded/src/query.rs:478-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/packages/sqlite-embedded/src/query.rs:485\u0060 calls \u0060default\u0060 and \u0060engine/packages/sqlite-embedded/src/query.rs:408\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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9811d53ed159ac11bd42758f62a7b8cabfcd4a5537ac5ca13a5c38cc4103fff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/topology/src/topology_machine/lease.rs:133-139 | engine/packages/topology/src/topology_machine/publication.rs:59-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3af01c6c932d03934a1ee76905ca1741950ef1c3ade2fa38e36c5b02294d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rivetkit-rust/packages/inspector-protocol/src/versioned.rs:537-543 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:648-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd26a23deb32bd16cb9f99cbd5b51bf23ce8f3bdb3ec5c0625ba9194eea1f30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1175-1181 | rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1681-1687 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4505266ef104d265fb9cb16d9a6b31298135bfa3b784ad070295fb41677f75e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:688-698 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:744-754 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs:688\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1fecc8a8babec5ade3fda4d9b0131aa05e8b62c4581d77bbc81b066a2c8e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/telemetry.rs:775-783 | rivetkit-rust/packages/rivetkit-core/src/telemetry.rs:803-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/telemetry.rs:775\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/telemetry.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"515ca5d85110f87daea37ec0a325302a41756965ed2564f2ade3153cdd7c52c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 4): rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:628-637 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:685-696 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:754-765 | rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:818-829 \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 \u0060rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs:628\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89ee1c577843a7f8817cb8b72124222feb7832bfb83397a21acdb08c4144885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2441-2446 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2481-2486 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2513-2518 \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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2441\u0060 it does not close everything it opens, so those exact 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, \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2512\u0060 calls \u0060repair_read_op\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:2440\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2804f1eef479f383ea020d17ae97ecf3a8c08feefdbd9ffcd7ef6cfc6959fa99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/packages/pegboard-envoy/src/sqlite/routing.rs:20-25 | engine/packages/pegboard-envoy/src/sqlite/routing.rs:41-46 | engine/packages/pegboard-envoy/src/sqlite/routing.rs:311-316 \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":"engine/packages/pegboard-envoy/src/sqlite/routing.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6278b3f5b8445bc8890435f225802b72f8984cdf8ceb6855a2c54ff990812068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/cli/src/commands/logs.rs:77-82 | engine/packages/cli/src/commands/logs.rs:111-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/commands/logs.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4792c91572cfd7368a5be10a51ef3930ee75df903bfbf379c8514252f0cbdee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/depot-client/src/filesystem/client.rs:1700-1705 | engine/packages/depot-client/src/filesystem/client.rs:1776-1781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"da44cac35eec0e20f521c1b0096028561d10c835429c6434b67d100bd8bc4d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-client/src/filesystem/txn.rs:381-388 | engine/packages/depot-client/src/filesystem/txn.rs:398-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/txn.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe0164e46ec272e62b72d66345c38aba4cbe3b7f470a33067e498e99f25b9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/depot-worker/src/command/groups.rs:234-239 | engine/packages/depot-worker/src/command/groups.rs:328-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/command/groups.rs:234\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/groups.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"064fa101b4f20ade3c3c2fdbdab90bbb07dcd1024e77ee7f54012b3b8a0ca4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/forks.rs:162-167 | engine/packages/depot-worker/src/filesystem/forks.rs:176-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/forks.rs:162\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/forks.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"603cb551add05d2efccd494eae9e4559093f35b20c9d2c287c4e16a445b7d0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/depot-worker/src/filesystem/session.rs:791-796 | engine/packages/depot-worker/src/filesystem/session.rs:846-851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/filesystem/session.rs:791\u0060 it begins part-way through the construct above it, so those exact 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":"engine/packages/depot-worker/src/filesystem/session.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8f83b7f1397aac825757c51fe33490f816d66589d47e97e359560508be7c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:60-66 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair_claims.rs:73-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.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":"engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"647ff02b658b3e3d1fd9697a0d09699f55e41deabc24e509a8b58f02e7bf71d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1210-1215 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1352-1357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d11bd8c224e31baf10123fb95d75398f96511dc8622d36ea0f556d84459d3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:70-75 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:2187-2192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5b3c576cc365d86edb2f4608f2182d7870ff0d1ae4c970488561c3ce4c8467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/engine-context/src/production/object_storage.rs:151-156 | engine/packages/engine-context/src/production/object_storage.rs:172-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 \u0060engine/packages/engine-context/src/production/object_storage.rs:151\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine-context/src/production/object_storage.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cdce67530331bbc6cb7904b357e9140aff9ff0979d31bb3cdc54a30cb83360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/engine-context/src/production/object_storage.rs:169-177 | engine/packages/engine-context/src/production/object_storage.rs:198-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/engine-context/src/production/object_storage.rs:169\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine-context/src/production/object_storage.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"616a744d9b9894f9c843abea7fa11b48db53f8f65a147ef3d652e7075d80e2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/engine/src/depot_command.rs:472-477 | engine/packages/engine/src/depot_command.rs:502-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine/src/depot_command.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef04fc6bf623a633595b50362560891eb9c467a679fb95067d023427c50f07ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/pegboard-gateway/src/migrate_from_v2/proxy.rs:144-150 | engine/packages/pegboard-gateway/src/migrate_from_v2/proxy.rs:182-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard-gateway/src/migrate_from_v2/proxy.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/migrate_from_v2/proxy.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"72833ba03611a6e95a6c3b0d881edf6a74dc1169885ba2bae0de53afbecd2999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/sqlite-prefetch/src/recency.rs:151-157 | engine/packages/sqlite-prefetch/src/recency.rs:209-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/recency.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e9d221167ff86158eab2330314746250e299fc65100e0f09abcb5f88ec0ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/state-machine-durable/src/runner.rs:531-536 | engine/packages/state-machine-durable/src/runner.rs:568-573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/state-machine-durable/src/runner.rs:531\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine-durable/src/runner.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cdeea89664b8e43316ec34a43759bcca30b64c736b909e964ee08c41e6ab5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/sdks/rust/envoy-client/src/handle.rs:906-911 | engine/sdks/rust/envoy-client/src/handle.rs:946-951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/envoy-client/src/handle.rs:906\u0060 it does not close everything it opens, so those exact 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 \u0060request\u0060 to \u0060SqliteRequest\u0060 in one and \u0060RemoteSqliteRequest\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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"85988ebed063c47619aa18fa164418b9b18ab1687b4011f53066a9d7bf9d5a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rivetkit-rust/packages/inspector-protocol/src/versioned.rs:1167-1184 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:1269-1286 \u2014 both copies are in the same file, so extract the block 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":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c062f1e06b160023e0845daa88cf0aa026547ced659c6c476c3db5786a424350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:619-624 | rivetkit-rust/packages/shared-types/src/endpoint.rs:121-126 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf951843f50c846afc5bc22e4c3e9e71ce886c659845b1b6337f26f3670812a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:880-885 | rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:947-952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:880\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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 \u0060payload\u0060 to \u0060CreateConnStatePayload\u0060 in one and \u0060BeforeConnectPayload\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:878\u0060 calls \u0060set\u0060 and \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:945\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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ab2a7a7051b670d36c9b58070f244ec2b71845bc6010676e40c07f8bda2bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/auth-jwt/src/rotation.rs:154-160 | engine/packages/pegboard-v2-migrator/src/requests.rs:181-187 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/auth-jwt/src/rotation.rs:154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/packages/auth-jwt/src/rotation.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fff4ec9d27a12470e0f48b82c69a43ff6672c878a64fa816940747a04eb750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/depot-client/src/filesystem/cache.rs:446-452 | engine/packages/depot-client/src/filesystem/cache.rs:511-517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-client/src/filesystem/cache.rs:446\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50c2607bde5ecff7f8c756da5057695d8c6b5ffcb2bf6165482ae0e5ae5313d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/depot-client/src/filesystem/client.rs:1894-1898 | engine/packages/depot-client/src/filesystem/recovery.rs:46-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f80ab730556576a2f93d5b8c7108b85a7c1b219d5073c75f8f9de5b6744b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/depot-worker/src/command/mod.rs:870-874 | engine/packages/depot-worker/src/command/mod.rs:912-916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/command/mod.rs:870\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/mod.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"b119d7b5ca92c319d685a9335ac7d4191e367c6a3935eede8f6cbdee204e4d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:143-148 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:281-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:149\u0060 calls \u0060request_count\u0060, \u0060Some\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:286\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbe2f48ad359af545dd5f714b8665873af53a7005d3023503ea7c885995037c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:442-446 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs:459-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"925d04a938163a99ac749b28fd2153df744cc03e3a9a9400565820cd1079747f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/durable-reconciler/src/core/reconciliation_machine/mod.rs:77-81 | engine/packages/durable-reconciler/src/core/reconciliation_machine/mod.rs:87-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/durable-reconciler/src/core/reconciliation_machine/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc71d1ef40e506a0e26428dbb6b2ac516a042482885eec24a013bb64d6630dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/env/src/backends/production/fs.rs:233-237 | engine/packages/env/src/backends/production/slatedb.rs:284-288 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/env/src/backends/production/fs.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060root\u0060 to \u0060\u0026Path\u0060 in one and \u0060\u0026std::path::Path\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/backends/production/fs.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4737326d2b7bdacd8081c4070a613730295c15499809ca82366b59b39b9f5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/sqlite-prefetch/src/driver.rs:106-110 | engine/packages/sqlite-prefetch/src/driver.rs:141-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-prefetch/src/driver.rs:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/driver.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"172ad24d530d9d459a21252e22fa6be3658d3bad0f1405c6ce730613aac24798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs:179-187 | engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs:306-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs:179\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs:178\u0060 calls \u0060V1\u0060, \u0060put_body\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs:305\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5ff0f4e5833db0073a18d2780b56c134f5d3efe82d304b180b95269b9dc66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/mod.rs:75-81 | engine/sdks/rust/data/src/versioned/topology_worker_heartbeat.rs:53-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"504832aad03c5e9b85f7e75f386c3df28b65409456f6a14e6b070e97abb4e3a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-python/client/src/simple/async/handle.rs:162-169 | rivetkit-python/client/src/simple/sync/handle.rs:150-157 \u2014 \u0060rivetkit-python/client/src/simple/async/handle.rs\u0060 and \u0060rivetkit-python/client/src/simple/sync/handle.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 51 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/simple/async/handle.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1660b27ad5105bc368636bb6e928c1cbef79e3c915d02be603ea03be266225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:693-698 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:712-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca170e278f25409ca884ac8688b2ddfa7f09a8e90c7403a54f478faf7411727a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/packages/auth-jwt/src/key_ring_machine/mod.rs:424-445 | engine/packages/cluster-config/src/cluster_config_machine/mod.rs:353-375 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060engine/packages/auth-jwt/src/key_ring_machine/mod.rs:424\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/key_ring_machine/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b969a432e50a99475d23bdc82fff44ca344dcf9838f22494c73c2be4cf14f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:210-239 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:212-241 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:216-245 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v2::ActorPhase\u0060 in one and \u0060pegboard_actor_v3::ActorPhase\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d4e4f180da4219ae5b016a6d7b21697f638fc704ad8dc5ca55af80502b9212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 6): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:594-646 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:593-645 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:615-667 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:639-691 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:638-690 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:638-690 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:594\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v2::ActorEvent\u0060 in one and \u0060pegboard_actor_v3::ActorEvent\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81b76b2ae27603a1e9f5ce364e7aa327b27c3939bd6094db0ee285e74223824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 4): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:394-438 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:413-457 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:417-461 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:417-461 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 232 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v3::ActorTimer\u0060 in one and \u0060pegboard_actor_v4::ActorTimer\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43ff7ba3b0bff6281483dc1a84f55ccd240709890a59d69f96c5b815c2f4341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:236-268 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:236-268 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 285 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:236\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v4::ActorPhase\u0060 in one and \u0060pegboard_actor_v5::ActorPhase\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39f1cb74a91c276727223bb2ea400d1dd5e8b0587f65aa18772a27c796a17bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/packages/api-public/src/actors/list.rs:45-50 | engine/packages/api-public/src/namespaces.rs:25-30 | engine/packages/api-public/src/runners.rs:27-32 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/packages/api-public/src/actors/list.rs:54\u0060 calls \u0060Name\u0060, \u0060clone\u0060 and \u0060engine/packages/api-public/src/namespaces.rs:34\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":"engine/packages/api-public/src/actors/list.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4383fabe6c2db2383b670d14518c7f6d28200eb2f09a67fc47c5a94d2d9fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/depot-client/src/volume_requests.rs:232-236 | engine/packages/depot-client/src/volumes/mod.rs:495-499 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060engine/packages/depot-client/src/volumes/mod.rs:495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060mut\u0060 in one and \u0060crate) fn with_dispatch_guard( mut\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":"engine/packages/depot-client/src/volume_requests.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c679cf297dbba521c8befa1321ad974ac4d99cd4cd4576493e89e4fd1fcad9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/depot-volume/src/ups/client.rs:218-226 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:391-399 \u2014 before extracting anything, compare \u0060engine/packages/depot-volume/src/ups/client.rs\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-volume/src/ups/client.rs:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/ups/client.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b2b79ffdfb67b7b4a4bc13ea8c192ab7cc52eafb39e75d5ac3555e083fe430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/packages/depot-volume/src/ups/client.rs:262-275 | engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs:435-448 \u2014 before extracting anything, compare \u0060engine/packages/depot-volume/src/ups/client.rs\u0060 and \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/executor/repair.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-volume/src/ups/client.rs:262\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/ups/client.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d88d6a5d9b379258205e165d1fd81e674efed40a8ccf27b22cd990221dcc22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/epoxy/src/commands.rs:96-100 | engine/packages/pegboard/src/index.rs:2008-2012 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/packages/epoxy/src/commands.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b489470e86c1a41948254dda29eea51a0faa8d3528c9254284ec4593b8f156a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:2125-2132 | engine/packages/pegboard/src/legacy_backfill.rs:1722-1729 \u2014 before extracting anything, compare \u0060engine/packages/pegboard/src/actor_machine/mod.rs\u0060 and \u0060engine/packages/pegboard/src/legacy_backfill.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8452c151c35ec5b5bfad1848f060f50e8d604293454070fe4abf53c940355597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/mod.rs:3575-3580 | engine/packages/pegboard/src/namespace_machine/mod.rs:946-951 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060waiter\u0060 to \u0060\u0026wire::StartWaiter\u0060 in one and \u0060\u0026ns::NamespaceWaiter\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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0081a831c146b872dd8f7a05192f83754e3c37ff03bc0afd7d5323a62db1bd23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/pegboard/src/legacy_backfill.rs:1334-1338 | engine/packages/pegboard/src/legacy_volumes.rs:369-373 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/legacy_backfill.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"e463f5584a1c70e867cf542ffa2abdd529888e2e3ed3853d714cadc69cfd67dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/runtime/src/traces.rs:24-33 | rivetkit-typescript/packages/rivetkit-napi/src/lib.rs:36-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/packages/runtime/src/traces.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"33197397fb79036e67b7b8acb50106a292fc5fe832cdde38f0027de43285424a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): engine/packages/sqlite-embedded/src/page_buffer.rs:85-91 | engine/packages/sqlite-embedded/src/page_buffer.rs:133-139 | engine/packages/sqlite-embedded/src/worker.rs:351-357 | engine/sdks/rust/envoy-client/src/sqlite.rs:23-29 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/page_buffer.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"de798f829cc801e71034469d56fbffdc9e3abde6e075bc13e3e8c6966f586d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:83-91 | engine/packages/sqlite-embedded/src/worker.rs:2221-2229 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e56c5915e985fdf10a36799883b141c6bbd55c3b9a1286231cca1ea2d7bdf73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/sqlite-embedded/src/worker.rs:361-366 | engine/sdks/rust/envoy-client/src/sqlite.rs:33-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/worker.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bd2a929afd1cdfd37078112987775fadd202c9e9853ea3834c6d4c72dc6b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:10-20 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:12-22 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.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 \u0060x\u0060 to \u0060pegboard_actor_v1::ActorData\u0060 in one and \u0060pegboard_actor_v3::ActorData\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b8df4b389db28dd6f812670b22ebff084f417fcee7785e3ebacab57041add4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:94-103 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:96-105 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs: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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v1::ActorCreateData\u0060 in one and \u0060pegboard_actor_v3::ActorCreateData\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0a40ecbdd37837f62de8c7c21e2f9cd64ed53844290f647b9f8608afb88bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:1037-1045 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:1178-1186 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 139 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:1037\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v1::NodePoolConfig\u0060 in one and \u0060pegboard_actor_v3::NodePoolConfig\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86fb3618a44f24d465a41fb20b8ab38b74f92ae90f9aaa7f966dc25e3d1463c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:10-20 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:15-25 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.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 \u0060x\u0060 to \u0060pegboard_actor_v2::ActorData\u0060 in one and \u0060pegboard_actor_v4::ActorData\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61f36c91e5fc4f3b06dff839e2013c28a71e1c9a0bd2cb1073758dbafed833c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:94-103 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:102-111 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs: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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v2::ActorCreateData\u0060 in one and \u0060pegboard_actor_v4::ActorCreateData\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"671d9cec632611a273018fe9a18cc710fad59cbac9f423287aa9d6299006f23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:997-1005 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:1057-1065 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:997\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v2::ActiveEnvoyState\u0060 in one and \u0060pegboard_actor_v4::ActiveEnvoyState\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33e88a86c06c319ff59b6f4e4f11ed6ae7d873beeb84ee0a05ceeab523ec24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1009-1019 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:1069-1079 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1009\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v2::IndexUpsertActiveEnvoyRequest\u0060 in one and \u0060pegboard_actor_v4::IndexUpsertActiveEnvoyRequest\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ceb67fa01ee1d00587be844a8508844fbb76b8e35a5e08bc788982501316b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1179-1187 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:1239-1247 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs\u0060 as WHOLE FILES: this scan already matched 21 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1179\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v2::NodePoolConfig\u0060 in one and \u0060pegboard_actor_v4::NodePoolConfig\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38467ee0f76ef9fa769fb736cadcb425989130878c1c4580da112db5f7e0d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:12-22 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:11-21 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v3::ActorData\u0060 in one and \u0060pegboard_actor_v5::ActorData\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e91897e90ba22bbe12fa8ef4c1a8ecd166d1e935335f478661b325a59068e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:96-105 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:96-105 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:96\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v3::ActorCreateData\u0060 in one and \u0060pegboard_actor_v5::ActorCreateData\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bc2f29fd63d319b535739be8938188e9b0a1bcc0ba8d7a36fce5ce7a2276b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1019-1027 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:1046-1054 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1019\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v3::ActiveEnvoyState\u0060 in one and \u0060pegboard_actor_v5::ActiveEnvoyState\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcd01bdd0cdd0be1f9122f488ffe0bad8012902eed48c36aeefb53a39db1f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1031-1041 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:1058-1068 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1031\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v3::IndexUpsertActiveEnvoyRequest\u0060 in one and \u0060pegboard_actor_v5::IndexUpsertActiveEnvoyRequest\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"c467b94cc960545a76c85b1cd693c9643e8c2a42754540b1e85c468fc9afd620"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1201-1209 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:1228-1236 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs\u0060 as WHOLE FILES: this scan already matched 22 separate duplicated blocks between them, totalling at least 282 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1201\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v3::NodePoolConfig\u0060 in one and \u0060pegboard_actor_v5::NodePoolConfig\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecb5e2e6b7f63e2a40f0db40e551d2ab410cd8b4a3d6547e8f45edad5681902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/mod.rs:52-57 | engine/sdks/rust/data/src/versioned/topology_worker_heartbeat.rs:29-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/sdks/rust/data/src/versioned/pegboard_v2_migrator/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d65f45e9744b116f18e06268a19f81eebf1e14f348bda78cbd9249526e372a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/sdks/rust/envoy-client/src/handle.rs:982-987 | engine/sdks/rust/envoy-client/src/tunnel.rs:116-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/sdks/rust/envoy-client/src/tunnel.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d6e4e33520146023c65403d00846182be8b95444c7ac362d5213eb3de975b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rivetkit-python/client/src/events/async/client.rs:27-39 | rivetkit-python/client/src/simple/async/client.rs:27-39 \u2014 before extracting anything, compare \u0060rivetkit-python/client/src/events/async/client.rs\u0060 and \u0060rivetkit-python/client/src/simple/async/client.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/events/async/client.rs:27\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/client.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3184878b444089662fab9554c660f4c1f8b64f18955dbd3f8b78cf7d0f91c306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): rivetkit-python/client/src/events/async/client.rs:107-116 | rivetkit-python/client/src/events/sync/client.rs:86-95 | rivetkit-python/client/src/simple/async/client.rs:101-110 | rivetkit-python/client/src/simple/sync/client.rs:87-96 \u2014 before extracting anything, compare \u0060rivetkit-python/client/src/events/async/client.rs\u0060 and \u0060rivetkit-python/client/src/simple/async/client.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/events/async/client.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/client.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ddc4ed8d50b2b2dd31ad50c3073bc9c096d0b7dede63a536d8c2509be1aaad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): rivetkit-python/client/src/events/async/client.rs:120-129 | rivetkit-python/client/src/events/sync/client.rs:99-108 | rivetkit-python/client/src/simple/async/client.rs:114-123 | rivetkit-python/client/src/simple/sync/client.rs:100-109 \u2014 before extracting anything, compare \u0060rivetkit-python/client/src/events/async/client.rs\u0060 and \u0060rivetkit-python/client/src/simple/async/client.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/events/async/client.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/client.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab609e4dc3cfc6c4070aa60a744fa9f65e6769b3d4ca74af15b96c7b74996647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rivetkit-python/client/src/events/async/handle.rs:86-94 | rivetkit-python/client/src/simple/async/handle.rs:176-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"rivetkit-python/client/src/events/async/handle.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48ba1f4048653e89eb78a220460342f23e71f9e1a9f77ff4f1510379824d34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rivetkit-python/client/src/events/sync/client.rs:24-36 | rivetkit-python/client/src/simple/sync/client.rs:24-36 \u2014 before extracting anything, compare \u0060rivetkit-python/client/src/events/sync/client.rs\u0060 and \u0060rivetkit-python/client/src/simple/sync/client.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-python/client/src/events/sync/client.rs:24\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/sync/client.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fada2b628b03ffffff2b9ca9d3992a8243ae49f49c18af09e7f53267eefffd63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:649-656 | rivetkit-rust/packages/shared-types/src/endpoint.rs:143-150 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f15783f84967130e68d7d2bab27904d270702aa522f158d1ee00f00e1b50fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs:363-368 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:80-85 \u2014 before extracting anything, compare \u0060rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs\u0060 and \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_factory.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7010d9d92ee1c9f7a51e94bfda475db3fab6f5251d47ca2b0fcf729b36d5eb05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/packages/api-public/src/actors/create.rs:45-50 | engine/packages/api-public/src/actors/get_or_create.rs:53-58 | engine/packages/api-public/src/runner_pools/serverless_health_check.rs:63-68 \u2014 before extracting anything, compare \u0060engine/packages/api-public/src/actors/create.rs\u0060 and \u0060engine/packages/api-public/src/actors/get_or_create.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/api-public/src/actors/create.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":"engine/packages/api-public/src/actors/create.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"67651785b9fd99d8fb9a9b4f9e6b38356257153bde4e7119d90b8391126afa4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/api-public/src/actors/delete.rs:37-42 | engine/packages/api-public/src/actors/kv_get.rs:33-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/api-public/src/actors/delete.rs:37\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/actors/delete.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1694e89794d4bc933cf5580f1df0ffd5b99968b02d66f3ca105220a5a40da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/api-public/src/actors/reschedule.rs:34-39 | engine/packages/api-public/src/actors/sleep.rs:34-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 \u0060engine/packages/api-public/src/actors/reschedule.rs:34\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/actors/reschedule.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4ca065eeaa4b73a2073ac8214eecfe089c8e791d9e321fcd4d115072345e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/packages/api-public/src/datacenters.rs:23-28 | engine/packages/api-public/src/health.rs:52-57 | engine/packages/api-public/src/metadata.rs:35-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/datacenters.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c13f5a6e2a5f7bafa4a706219b6021906a6d23ef3703cfaf319c5c3eae30fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/api-public/src/runner_pools/refresh_metadata.rs:58-63 | engine/packages/api-public/src/runner_pools/upsert.rs:45-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/packages/api-public/src/runner_pools/refresh_metadata.rs:58\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/runner_pools/refresh_metadata.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc0681eced3a0e8ed91632b8bc8105a55672b8e841abace4968dd9ef46dee52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/depot-client/src/filesystem/cache.rs:223-230 | engine/packages/depot-client/src/filesystem/rollback.rs:73-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4c85bc2239c858eb87cef6cc73454836e0dbc060670dcadd5a83f2908b6c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/state-machine/src/state_machine.rs:102-108 | engine/packages/topology/src/topology_machine/state.rs:262-268 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060op\u0060 to \u0060OpId\u003CS\u003E\u0060 in one and \u0060OperationId\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":"engine/packages/state-machine/src/state_machine.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcdb0e12b63d90f6a3df8f192a47156bcb5b4201441eb8d6ffb2c0dc18184cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v1_to_auth_grants_v2.rs:10-15 | engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v2_to_auth_grants_v1.rs:16-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v1_to_auth_grants_v2.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 \u0060x\u0060 to \u0060auth_grants_v1::TargetScope\u0060 in one and \u0060auth_grants_v2::TargetScope\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":"engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v1_to_auth_grants_v2.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fde4924693d0f874407e5ba960132bca164e6fd44a070fe5d959c5ba367e7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v1_to_auth_grants_v2.rs:61-69 | engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v2_to_auth_grants_v1.rs:68-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v1_to_auth_grants_v2.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/auth_grants/auth_grants_v1_to_auth_grants_v2.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"10826df14eac4b53b3179d6284f5e4a50066a88fa0f28a5b7baf996066065b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/sdks/rust/data/src/versioned/depot_fs.rs:125-132 | engine/sdks/rust/data/src/versioned/mod.rs:50-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/depot_fs.rs:125\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/src/versioned/depot_fs.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9523e5a031ce1b272f645f589b74759db5799668d9b28d92b03de36c67eb51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 24): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:54-60 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:161-167 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:243-249 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:54-60 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:161-167 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:245-251 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:54-60 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:169-175 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:269-275 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:56-62 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:171-177 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:271-277 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:56-62 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:171-177 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:275-281 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:62-68 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:177-183 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:294-300 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:56-62 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:171-177 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:298-304 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:56-62 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:171-177 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:298-304 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:54\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v1::ReserveEpoxyState\u0060 in one and \u0060pegboard_actor_v1::DestroyState\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8db6d595e815a0b5244b884cc637786d3d62953a2770709eb265e0cb9855f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:64-71 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:253-260 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:64-71 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:64-71 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:66-73 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:281-288 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:66-73 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:72-79 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:66-73 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:66-73 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:64\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v1::ReserveEpoxyEffectData\u0060 in one and \u0060pegboard_actor_v1::WriteIndexEffectData\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eabb25877938ebe8e4e8e8aec3c348084fe2f18de01f609585938806c488cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:107-117 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:107-117 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:107-117 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:109-119 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:109-119 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:115-125 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:109-119 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:109-119 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v1::Initializing\u0060 in one and \u0060pegboard_actor_v2::Initializing\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3784bba1def1bfa71971df86cb81131bd5059b8cefdfbdd7f290087b8b36c76b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 9): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:145-157 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:227-239 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:145-157 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:153-165 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:155-167 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:155-167 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:161-173 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:155-167 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:155-167 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v1::DestroyPhase\u0060 in one and \u0060pegboard_actor_v1::WriteIndexPhase\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0274ac1b436cd352faa7c2743308e4e3c847e53d7b6d33c00aa2d443be109db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:372-379 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:393-400 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:434-441 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:433-440 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:454-461 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:473-480 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:477-484 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:477-484 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:372\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v1::TryStart\u0060 in one and \u0060pegboard_actor_v2::TryStart\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c330cd9d2f54a950fb1686d12c29a8ae26a548da680ead1bd9dc6c32f4769a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:383-391 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:605-613 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:404-412 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:635-643 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:445-453 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:746-754 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:444-452 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:745-753 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:383\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v1::Create\u0060 in one and \u0060pegboard_actor_v1::ActorCreateRequest\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b3b45ee5e494407be56f2ca3ce54abb7df2a26e01b1eb750825c618224bb42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:395-404 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:416-425 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:457-466 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:456-465 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:478-487 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:502-511 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:501-510 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:501-510 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:395\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v1::Reallocate\u0060 in one and \u0060pegboard_actor_v2::Reallocate\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be58d824edef7c8fb32deeb48677b6f48555a3c554437a61ca3ed90f57c6f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:408-414 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:429-435 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:470-476 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:469-475 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:491-497 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:515-521 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:514-520 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:514-520 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:408\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v1::UpdateRoute\u0060 in one and \u0060pegboard_actor_v2::UpdateRoute\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"db54ff708b06d35f6161f99ad8ba1c88cabd30ec6de93cea3d026d5f5a250757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:708-717 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:744-753 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:850-859 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:849-858 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:872-881 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:910-919 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:899-908 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:899-908 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:708\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v1::IndexListActorsRequest\u0060 in one and \u0060pegboard_actor_v2::IndexListActorsRequest\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cdb1844e50ec09ee24b1fc1ff06763fea1a81a91c7e4e3c4a8c7fbbdf420d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:791-799 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:826-834 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:933-941 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:932-940 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:955-963 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:993-1001 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:982-990 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:982-990 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:791\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v1::EnvoyUpsertRequest\u0060 in one and \u0060pegboard_actor_v2::EnvoyUpsertRequest\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc966b5c04ce27621615976e191f6c4263ed6524050065a4b429a7887e0f78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 32): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:922-931 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:941-950 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:1016-1025 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:1160-1169 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:954-963 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:973-982 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:1048-1057 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:1192-1201 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1064-1073 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1083-1092 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1158-1167 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1302-1311 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:1063-1072 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:1082-1091 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:1157-1166 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:1301-1310 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1086-1095 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1105-1114 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1180-1189 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1324-1333 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:1124-1133 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:1143-1152 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:1218-1227 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:1362-1371 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:1113-1122 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:1132-1141 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:1207-1216 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:1351-1360 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:1113-1122 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:1132-1141 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:1207-1216 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:1351-1360 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:922\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v1::IndexListActiveEnvoysResponse\u0060 in one and \u0060pegboard_actor_v1::IndexListActiveEnvoyStatesResponse\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"8996923365191ce71d8f6399bddc753e2bf806dcf95c2b60f0c935c39c33542d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:1103-1109 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs:1135-1141 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:1245-1251 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:1244-1250 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:1267-1273 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:1305-1311 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:1294-1300 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:1294-1300 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v1.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs:1103\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v1::PoolStatus\u0060 in one and \u0060pegboard_actor_v2::PoolStatus\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v1_to_pegboard_actor_v2.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfda3e3a9644c41fa65d9e625d2c1818aff785d81d19de7d033744aa4e8cd8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:197-206 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:199-208 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:203-212 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:216-225 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:223-232 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:223-232 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:197\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v2::MigratingFromV2\u0060 in one and \u0060pegboard_actor_v3::MigratingFromV2\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"910fe0845fae03069b2c9d76bfaea6a5757d8b29c7c600af11c34497127b1795"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:290-295 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:292-297 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:296-301 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:315-320 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:319-324 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:319-324 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:290\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v2::StorageOrigin\u0060 in one and \u0060pegboard_actor_v3::StorageOrigin\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa79ec5014a2b6c7c428b2961d95866f3d01912ba1b8c81e18124608d72f9f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:532-538 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs:531-537 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v4.rs:553-559 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v3.rs:577-583 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:576-582 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:576-582 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v3_to_pegboard_actor_v2.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs:532\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v2::MigrateFromV2Begin\u0060 in one and \u0060pegboard_actor_v3::MigrateFromV2Begin\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v2_to_pegboard_actor_v3.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc22255c0f2884dd35783bfb18cba8d9dd86135540d6d480fa6e3c6b4cdb6557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:198-207 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:198-207 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 285 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060pegboard_actor_v4::KeyOwner\u0060 in one and \u0060pegboard_actor_v5::KeyOwner\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0849ebb1507c873fdd19be84209b248571adf80acce024f5e85c2626b0167558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:488-497 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:793-802 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:488-497 | engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs:793-802 \u2014 before extracting anything, compare \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs\u0060 and \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v5_to_pegboard_actor_v4.rs\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 285 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs:488\u0060 it begins part-way through the construct above it, so those exact 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 \u0060x\u0060 to \u0060pegboard_actor_v4::Create\u0060 in one and \u0060pegboard_actor_v4::ActorCreateRequest\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":"engine/sdks/rust/data/src/versioned/pegboard_actor/pegboard_actor_v4_to_pegboard_actor_v5.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d954a1e70a8f6103e6844fe33ecc8247fa67bdab1c9cfeaf4705d2905b5c5ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-napi/src/kv.rs:32-37 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:2037-2042 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key\u0060 to \u0060Buffer\u0060 in one and \u0060Vec\u003Cu8\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":"rivetkit-typescript/packages/rivetkit-napi/src/kv.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"690f1839d8fa96f690703a3cd3b5344f0f5af1719f2402ecfa3eefc0ad3908b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): engine/sdks/rust/envoy-client/src/actor.rs:1053-1067 | engine/sdks/rust/envoy-client/src/actor.rs:1251-1265 | engine/sdks/rust/envoy-client/src/actor.rs:1275-1289 \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 \u0060engine/sdks/rust/envoy-client/src/actor.rs:1053\u0060 it begins part-way through the construct above it, so those exact 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, \u0060engine/sdks/rust/envoy-client/src/actor.rs:1268\u0060 calls \u0060remove\u0060 and \u0060engine/sdks/rust/envoy-client/src/actor.rs:1290\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":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1fa441bd9bde3b3383b27283ff401dfb80f679e3d061754a8053a8218d889b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/pegboard/src/namespace_machine/executor.rs:285-297 | engine/packages/pegboard/src/namespace_machine/executor.rs:341-348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/pegboard/src/namespace_machine/executor.rs:285\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"engine/packages/pegboard/src/namespace_machine/executor.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f9d82c636a398dbadf550ff7242ad6e7be1b3ad9af82945de309d1a167f94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:226-238 | rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:348-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:226\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9d7696ccaaf80f100583e24574904d8f51f7973d5b7be32973936534933115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/packages/api-public/src/actors/reschedule.rs:61-72 | engine/packages/api-public/src/actors/sleep.rs:60-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 \u0060engine/packages/api-public/src/actors/reschedule.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/actors/reschedule.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"45704e400b9ade88afd53e41b53efba61e8d3acd234c657a221fe392fce414f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rivetkit-rust/packages/client/src/client.rs:186-196 | rivetkit-rust/packages/rivetkit-core/src/registry/envoy_callbacks.rs:197-207 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060rivetkit-rust/packages/client/src/client.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":"rivetkit-rust/packages/client/src/client.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c141239740f9a46d6fdc816d5125260b5e604457e0f1a7c0c9f70b9a89f64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/packages/error-macros/src/lib.rs:19-29 | engine/packages/error-macros/src/lib.rs:245-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/error-macros/src/lib.rs:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e2fd62a120e981f0f4cf4eb6f79bf3559adf00087fc86db4a2764149a7f78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/packages/sqlite-embedded/src/vfs/transport.rs:3427-3436 | engine/packages/sqlite-embedded/src/vfs/transport.rs:3459-3468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/sqlite-embedded/src/vfs/transport.rs:3427\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-embedded/src/vfs/transport.rs"},"region":{"startLine":3427}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c61957c3a6499d5d851c3f3f36d18903eb6eb388f7533bc6b298b3dd0c79047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1855-1863 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1888-1896 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1924-1932 | engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1957-1965 \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 \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs:1855\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb2379024808c8da37d8c449d573371a13d9cfa7d346f00b0b267034a059c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/packages/pegboard/src/actor_machine/executor.rs:1610-1617 | engine/packages/pegboard/src/actor_machine/executor.rs:1924-1931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"718aec7759d031e54733359b42ee2c922a8dec5401c46094696e880e216a6dcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1645-1652 | rivetkit-rust/packages/rivetkit-core/src/serde_metrics.rs:77-84 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs:1645\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f7560b50630ef38664e7c5bcfd22335769f286b1b29a2a42ef06dff9343cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:926-933 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:963-970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:926\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca975434a48e53873f32c9c64ec2f590120c81052bd6359d50e6cb4ab3f84751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs:314-321 | rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs:344-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.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":"rivetkit-rust/packages/rivetkit-core/src/actor/migrate_kv_to_sqlite/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"537014df67eed67711231a551e06aa28cda020f1499e8de5921547e65023ec0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:965-971 | rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:1004-1010 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs:965\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b62e38e15e984ba03044e6810603757079a3a0fc3de03fd25072c3079ec6a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 6): rivetkit-rust/packages/actor-persist/src/versioned.rs:53-56 | rivetkit-rust/packages/client-protocol/src/versioned.rs:35-41 | rivetkit-rust/packages/client-protocol/src/versioned.rs:438-441 | rivetkit-rust/packages/client-protocol/src/versioned.rs:669-675 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:40-43 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:349-352 \u2014 before extracting anything, compare \u0060rivetkit-rust/packages/actor-persist/src/versioned.rs\u0060 and \u0060rivetkit-rust/packages/client-protocol/src/versioned.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060rivetkit-rust/packages/actor-persist/src/versioned.rs:53\u0060 it does not close everything it opens, so those exact 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, \u0060rivetkit-rust/packages/client-protocol/src/versioned.rs:33\u0060 calls \u0060Ok\u0060, \u0060V1\u0060, \u0060decode\u0060 and \u0060rivetkit-rust/packages/actor-persist/src/versioned.rs:53\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":"rivetkit-rust/packages/actor-persist/src/versioned.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2a6d384281f3ca66de56315eaf6f998f3cd720e60f4706919b2c1d4632ee07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rivetkit-rust/packages/inspector-protocol/src/versioned.rs:42-51 | rivetkit-rust/packages/inspector-protocol/src/versioned.rs:351-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/inspector-protocol/src/versioned.rs:42\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/src/versioned.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0b16bf027b14b8acf4ea413535b5ef4f22d37fb69083736f7d323b532d2398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/depot-worker/src/services/coordinator.rs:55-60 | engine/packages/depot-worker/src/services/log_shard.rs:68-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/services/coordinator.rs:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/services/coordinator.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b37c0ae2756fd35808809a3e6996c418cdfd574e9b2de5718311b03b646e1e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/packages/cluster-config/src/store.rs:26-31 | engine/packages/depot-worker/src/tablet_coordinator_machine/store.rs:179-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060engine/packages/cluster-config/src/store.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":"engine/packages/cluster-config/src/store.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bca72c9a3abddaa792dc9e0cc1957566cb23164377dff62e9fdbaa1e0d4a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/packages/sqlite-embedded/src/query.rs:163-169 | engine/packages/sqlite-embedded/src/query.rs:199-205 \u2014 both copies are in the same file, so extract the block 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":"engine/packages/sqlite-embedded/src/query.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5045297f2f953baa94baa25e3011667531c9a214a0c5108bf6b3e6a4592a253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rivetkit-rust/packages/client/src/remote_manager.rs:206-210 | rivetkit-rust/packages/client/src/remote_manager.rs:269-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e3958e2936c520ef593b9e4b1493ebbc12f9997797b6cebd6b524deea15aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/cli/src/commands/pool.rs:161-165 | engine/packages/cli/src/target.rs:287-291 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"engine/packages/cli/src/commands/pool.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de7a97aa2fc0a23fe2dff72b1f2f6b492ca39c3af1e0d82a7af2c25a6c042f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/api-peer/src/repair/inspect.rs:150-154 | engine/packages/api-peer/src/repair/inspect.rs:174-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-peer/src/repair/inspect.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a0d1affde6b54278a62ee91080cfc54bd58bd6f6bc69a8614b894cbd627e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/packages/depot-client/src/filesystem/client.rs:1017-1021 | engine/packages/depot-client/src/filesystem/client.rs:1044-1048 | engine/packages/depot-client/src/filesystem/txn.rs:249-253 \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":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2860229f0a8e0f4380a4269cf3b98e3248544ba7822d81d5c910ba06dd80486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:1161-1165 | engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:1172-1176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs:1161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c31f0a0a8d34fbb04cee107ce8face16944b3c2bef938432c7a89471fd79dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:1040-1044 | rivetkit-rust/packages/rivetkit-core/src/registry/http.rs:1048-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46965c65c2981ba1eccdd5ed562ca6880a6ce196acfa681fbc253b833d7d84f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs:893-898 | rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs:911-916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs:893\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/websocket.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dbb36359d277952f9d64b541cddeed400991006db05bd15ea371cc43f6ca2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:1127-1150 | rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:87-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift: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. 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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1381fcfd5f9b33d6a74ec6ec5cd8d24265f41687e55cbe8b333e66b0a7e222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:134-149 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:183-198 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:209-224 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:240-255 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:272-287 \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 \u0060rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:134\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc6f2dcf7040500ecea0ee266c3a7278ef32fadf6b7fb47727a2db4edff32e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:228-241 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:289-302 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:321-334 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:358-371 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:396-409 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:426-439 \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 \u0060rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:228\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7cd576630792d3f45dd86fa00b1d2a7d384ebed4902c64371fbfa9d985349f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:216-226 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:245-255 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:277-287 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:309-319 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:346-356 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:384-394 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:414-424 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:216\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4525ce3e442b94a2eac320092154181a8365ec6f991b54f13db8ca86af7c105c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:227-237 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:336-346 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:227\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3245b4d4bcd98e2af1fee6420723ab62663e4e5026d85561fe2a6e8e21510a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:258-269 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:373-384 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e30cd74676bf00ffc1aa342b677b3af464143562d64faa877de9744063dae5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:118-126 | rivetkit-swift/Sources/RivetKitClient/ActorHandle.swift:61-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d666b3701d6bbd6d41e8cbf5adbd408a7a3e67bc6c699c15770e1ca4e2f39d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:649-655 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:666-672 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:684-690 | rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:703-709 \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 \u0060rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:649\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"416227e2ac0f8efa216dd2e1edcc4c10ddd5cb396f32635b854cb40fcf4f350f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:1160-1166 | rivetkit-swift/Sources/RivetKitClient/CBORSupport.swift:120-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b57d8e851288421de97de1b23c3c5ee120e5f9f93f770ae7142436f8792b07d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:175-180 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:272-277 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:175\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0a9f0c91ee58acc177f5f0cb585ecff34cf279912ca565f7efbbe3f3b0cb3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift:201-206 | rivetkit-swift/Sources/RivetKitSwiftUI/ActorObservable.swift:304-309 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift: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":"rivetkit-swift/Sources/RivetKitClient/ActorConnection.swift"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"83eaac10a6b3d47a571550b49c7c6297cb5aa4994e725ecdd9cbcc3437ac4449"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project depot-log: depot-log has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bfd17330279a7d33ce605ce87389037819584cc55124b6e24786f3b8df9a0f5e"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pegboard-envoy: pegboard-envoy has instability 0.91 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5818a344fa16ac284dabb084cfccd4f8089e4ceb0cbd91ba011542c435da0fb3"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pegboard-gateway: pegboard-gateway has instability 0.88 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e283d7ca459b260e630464a38ad59af6c2fc85c9d20a23aa6cf93b965ae2dc3"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rivet-api-peer: rivet-api-peer has instability 0.85 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9ab33b0bdcb1f0a87651c1f254ccf1fff5fd87d5aee89f08bae01510b228c8d9"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rivet-api-public-shim: rivet-api-public-shim has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9ea0d677df3ba1181d463d8072b1efdb01b1a1a26e03d95e94f6a1a21fde3bba"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project rivet-state-machine-durable: rivet-state-machine-durable has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1012440c56af9e4eb6e72e1c13f707fee9a231efdecfccf63f4ced6848d86f9c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: RivetKitClient: RivetKitClient: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ec9d92d5755d48e0add3d957262fda366007bc06260d6ad273ed1f1400bb466"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivet-config: rivet-config: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 22 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1a15d046c2dba16fa97afbbb499abad04ce241b4cacd6239a375a11bbaffdeda"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivet-sqlite-types: rivet-sqlite-types: 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":"72f65a23e72d7c6e8276e5965d22cca45228fb1d9df4e6c61999de9b93313914"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivetkit-actor-persist: rivetkit-actor-persist: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"98413f62432099274e929ea86e1a100c3746681d00a8f033a471d44a392cd796"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivet-error: rivet-error: abstractness 0.00, instability 0.04, distance 0.96 \u2014 zone of pain \u2014 concrete and depended on by 22 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"291a903f160a8a6a511ae4f863bf7a3d270157cbbb8a0176c9456894ff56660c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivet-metrics: rivet-metrics: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 26 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"825ef710e6c9f98e0bd1a2cabda4b41120698c86fc93493c4decf754722c5346"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivet-auth-policy: rivet-auth-policy: 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":"936683717291006e3517d6fd6cfbfa530b84e4b7287afa2efedfcd1e35f67d21"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivet-env: rivet-env: abstractness 0.20, instability 0.03, distance 0.76 \u2014 zone of pain \u2014 concrete and depended on by 28 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6b5bdb86e676d604db5c8dbbbbec4dcfad129c0884d1b6d244f1f6cee6306a8b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivet-util-serde: rivet-util-serde: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"85e1f466feb3998b93453b6f967f52bbb8e6fb78b04bd0998f269a6e0126893d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rivet-data: rivet-data: abstractness 0.22, instability 0.04, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 26 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e22b415835fb530f453f9ef0d2b01e0cdc2ac134cc1e125769aa54a50444f1df"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: depot-fs-core: depot-fs-core: abstractness 0.01, instability 0.25, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c3f4e0517338d196ab2b7a4c4d2ea2aeaf597e4c9473bf7ce7667dccffc02599"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @rivetkit/traces: @rivetkit/traces: abstractness 0.27, instability 0.00, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c08470d41fa5a8b3fa1149c2817b3fdaa0e1397295c43fbc92e514d068065c58"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: depot-types: depot-types: abstractness 0.00, instability 0.27, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"65d1bf1572f718d659ad27951dd49fa7f432dbf90150c0048171f97494cb843e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Connection (LCOM4 6): Connection\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/capabilities/http.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c05d9d05e01a2a172a9c97b49085095655764d79c0af48cc01f83d82dbf570"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CoreRegistry (LCOM4 4): CoreRegistry\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":"rivetkit-typescript/packages/rivetkit-napi/src/registry.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0380c839578267c1059a1c31a7ec8b428a261d1bec3c0cddc86bc0e8595bc1"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 engine/sdks/typescript/envoy-protocol/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit/src/registry/native.ts: rivetkit-typescript/packages/rivetkit/src/registry/native.ts changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 140 in native.buildNativeFactory at line 4159. 8 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit/src/registry/native.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"326793c95e9d37f6dcb66fcef64e77f9e60af96adc6a744997d535716d895998"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard/src/actor_machine/mod.rs: engine/packages/pegboard/src/actor_machine/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 157 in ActorStateMachine::on_event 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard/src/actor_machine/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":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8cb7d310de422392bf7279b17cde8f42d94818eecad427a9e13726c592287b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs: rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rivetkit_wasm::dispatch_event at line 774. 2 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"c577b565dcb0fd09ebb0212813930d986e8fe85794e7d772451c9222e6d858c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs: engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in TabletMaintainerMachine::on_event at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_maintainer_machine/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":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcab96feeee2527af61259bd9f305342c6b8407ef0829b17b0cef4a78e99e2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/sdks/rust/envoy-client/src/envoy.rs: engine/sdks/rust/envoy-client/src/envoy.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in rivet_envoy_client::envoy::envoy_loop at line 568. 4 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/sdks/rust/envoy-client/src/envoy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/envoy.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33daa77270ee369f8a038b4797536dd5da336063362b0550156654a516d668f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-rust/packages/rivetkit-core/src/actor/task.rs: rivetkit-rust/packages/rivetkit-core/src/actor/task.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ActorTask::start_actor at line 1270. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-rust/packages/rivetkit-core/src/actor/task.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3047d288fac8313c38dba63d62f60e6b45ffd8b3f197368bf1f07f2f5af642ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/sdks/rust/envoy-client/src/actor.rs: engine/sdks/rust/envoy-client/src/actor.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rivet_envoy_client::actor::actor_inner at line 284. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/sdks/rust/envoy-client/src/actor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe97868cf77ee1577d93bfac6a248fde0a6df82c197cbc071d31782d72f736e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard-envoy/src/connection.rs: engine/packages/pegboard-envoy/src/connection.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in pegboard_envoy::connection::handle_sub_stream at line 782. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard-envoy/src/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1873dec6dd9eddfc3543e441b148fc812a8e10316f6eab27b19b0bcff2e092c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/publish/src/lib/version.ts: scripts/publish/src/lib/version.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in version.bumpPackageJsons at line 197. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- scripts/publish/src/lib/version.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/version.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5943ff9fea7e239285771b6b8cef954119a6c1c70789d30c438e8bc6cd5c0966"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs: rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CoreRegistry::serve_with_config_and_handle_observer at line 623. 7 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-rust/packages/rivetkit-core/src/registry/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":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a77ddf04e8387d35370b5aecfbe139cc569ab6721ddb175aa28e97a948437e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard/src/actor_machine/executor.rs: engine/packages/pegboard/src/actor_machine/executor.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Executor::execute at line 1411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard/src/actor_machine/executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/executor.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dd41d8a9003926cdcd72d6fbd71dcd6b1af3675bdc1b711a0981c482a7fc59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs: rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rivetkit_napi::napi_actor_events::dispatch_event 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/napi_actor_events.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e3e6c3f6aa704517409001b3cbfb31ee2f5a11fc8319b10848db24efd7297f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/config/src/config/pegboard.rs: engine/packages/config/src/config/pegboard.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Pegboard::validate at line 207. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/config/src/config/pegboard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/config/pegboard.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17113a69303e77e648545998e06c874ae3f7c29b1a030de35d382756e9f5350"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts: rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ActorHandleRaw.#sendActionAttempts at line 357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"124cc13172b8b76f8535cdfb2b4bd184006477a141ab5fb007058a23170fadd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-rust/packages/rivetkit/src/start.rs: rivetkit-rust/packages/rivetkit/src/start.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rivetkit::start::handle_actor_event at line 346. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-rust/packages/rivetkit/src/start.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit/src/start.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b14dbc1a9bfef95538c9be8c17710ce3a0bf3294fbcd4cdfa670962b7b3f5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/sdks/rust/envoy-client/src/connection/native.rs: engine/sdks/rust/envoy-client/src/connection/native.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in rivet_envoy_client::connection::native::serve_connection at line 215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/sdks/rust/envoy-client/src/connection/native.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/connection/native.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58c7fd7a659a121b4369e4fcd1abf772636651095aa7e4913d70e36d657eeff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard-gateway/src/acquire.rs: engine/packages/pegboard-gateway/src/acquire.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Acquire::run 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard-gateway/src/acquire.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/acquire.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c99a8fffc7eb609ad98bd007646a3f59dedfbf6a3449a88345b2010e806bba0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/workflow-engine/src/context.ts: rivetkit-typescript/packages/workflow-engine/src/context.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in WorkflowContextImpl.executeRace at line 2380. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/workflow-engine/src/context.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d4b67d4aa47fe02c7b673f21a4cc75d05c1861630bb6443e7369feb4a0de6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/state-machine-durable/src/runner.rs: engine/packages/state-machine-durable/src/runner.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Runner::process_attempt at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/state-machine-durable/src/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine-durable/src/runner.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd76facbec1e7c95bd4fc4fae62f07dd5f906a56a18a1a55e4be16a619c360e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/publish/src/lib/packages.ts: scripts/publish/src/lib/packages.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in packages.discoverPackages 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- scripts/publish/src/lib/packages.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/packages.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d583285db35fbab988a1912ba265e792f7b82ed4945c99ce315a89b809eca3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/topology/src/topology_machine/executor.rs: engine/packages/topology/src/topology_machine/executor.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in TopologyExecutor::execute at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/topology/src/topology_machine/executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/executor.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8013e6dd3710f3114eb64f62b08d560895715d9c7f2f242503c62fafbb7c3805"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-client/src/command.rs: engine/packages/depot-client/src/command.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Client::command_with at line 182. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-client/src/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":"engine/packages/depot-client/src/command.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78d188d2d43f3c6c564592d5a776d80067e162083b5daa5016fee08a8482d68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts: rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ActorConnRaw.#handleOnClose at line 979. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb5dc8e0864e3d830b4024e8ff648e8dd6936b61cfefe3e892a7f669cfc9ed5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_maintainer_machine/state/operations.rs: engine/packages/depot-worker/src/tablet_maintainer_machine/state/operations.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in OperationIndex::apply at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_maintainer_machine/state/operations.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operations.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2540c9d60bcca45ea6d9cbbbe64c656751471938c6c9acbc78006383418ee397"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs: engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in depot_worker::tablet_maintainer_machine::state::operator_repair::activity::describe at line 221. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/activity.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5514e27819089a9a3ca7ce5522c36f1040f53e138c7db03561ebcce76594e0a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-rust/packages/engine-process/src/lib.rs: rivetkit-rust/packages/engine-process/src/lib.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EngineProcessManager::start_resolved at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-rust/packages/engine-process/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/engine-process/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a38e58e7815b47180f5c058b66644eaacfa51736d58775d5ec1c2f24486961"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-rust/packages/rivetkit-core/src/actor/config.rs: rivetkit-rust/packages/rivetkit-core/src/actor/config.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ActorConfig::from_input at line 459. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-rust/packages/rivetkit-core/src/actor/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/config.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7259da4ac88567b70d9eb626fe75ba9054b889a0adf60da4a6b18742012fc3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs: engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Maintainer::start_with_alarms at line 309. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/runner.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a6e6010a00ae5dbdcc2e5d84fc4447735200ed7939c5b4416125b22204302b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard-gateway/src/routes.rs: engine/packages/pegboard-gateway/src/routes.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in pegboard_gateway::routes::prepare at line 467. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard-gateway/src/routes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/routes.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f42feec5c41f33a5622162a344aaa6cf6534e3ad41e586b4496b4e51c3421f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/sdks/rust/envoy-client/src/connection/wasm.rs: engine/sdks/rust/envoy-client/src/connection/wasm.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rivet_envoy_client::connection::wasm::imp::single_connection at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/sdks/rust/envoy-client/src/connection/wasm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/connection/wasm.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe545184087bbe0d71958070d5b528632757897bbbf13d78ec52e11bfa0f3d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/engine/src/run_config.rs: engine/packages/engine/src/run_config.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rivet_engine::run_config::start at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/engine/src/run_config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine/src/run_config.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b7ed106728dd00bfb21a1046fd0cb5a20959d9d0d79d8936cff8cbfbb28656"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts: rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in index.RegistryConfigSchema at line 312. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac006e14ae9c2b0a5f30feb5aa216b062587fae6a2981645c34985969fe54a49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs: engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in depot_worker::tablet_maintainer_machine::state::filesystem::loaded at line 720. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"221c32a53aec5618653b20e5843b24c82e35204df96ac526bb65d8076afa8885"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs: engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in depot_worker::tablet_maintainer_machine::state::store::drive_queue at line 1223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5520c31e8d9bd2b342addc997cafc9280eab37c128e0c4ea003b0cb56895e6c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs: rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SqliteDb::release_transaction at line 1069. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"9111d630677837093f390ae015f701281a301e464037d139849755c9fe10dda2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs: engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Search::replacement at line 563. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/placement.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ab467f7a61f85dbdc75dc302d50a0a62192417728d61b2c1a10597d729ef29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs: engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in depot_worker::tablet_maintainer_machine::state::stop::completed at line 363. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e185809fbe2e799cd3f0c1201d397bd0a20d2ffe39ff8cc596ec1a759d5e8c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/publish/src/local/cut-release.ts: scripts/publish/src/local/cut-release.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in cut-release.main at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- scripts/publish/src/local/cut-release.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/local/cut-release.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"122284566e3a5d77e1edda73526624b9a9f371b2acee735e385a8af3a3047001"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/sdks/rust/envoy-client/src/tunnel.rs: engine/sdks/rust/envoy-client/src/tunnel.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rivet_envoy_client::tunnel::handle_tunnel_message at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/sdks/rust/envoy-client/src/tunnel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"469fa5dcf75daf26f0e5721c7f5274f142263e223e50289be613a164c873b3bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-rust/packages/rivetkit-core/src/actor/state.rs: rivetkit-rust/packages/rivetkit-core/src/actor/state.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ActorContext::apply_state_deltas_inner at line 787. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-rust/packages/rivetkit-core/src/actor/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":"rivetkit-rust/packages/rivetkit-core/src/actor/state.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"758435f6891bb198abb10a76e2bf9e2a5a21bfcc35aa528912938fe61730d3f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/config/src/lib.rs: engine/packages/config/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Config::apply_dynamic at line 218. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/config/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"58258c9adc1c705a9d299868477c3c3c7c08314cbf7b46e1464f2774084d75f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/guard-core/src/response_body.rs: engine/packages/guard-core/src/response_body.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ResponseBody::poll_frame at line 132. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/guard-core/src/response_body.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/guard-core/src/response_body.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3fb30cd99d428162670dc3efee87eccf546f6fab47c03bf935494079aa8a92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts: rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in lifecycle-errors.classifyActorError at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"55070d745c583afd28199e256c4cd25eae439b544fa1984888acd05a7e398cc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/publish/src/lib/npm.ts: scripts/publish/src/lib/npm.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in npm.publishAll at line 321. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- scripts/publish/src/lib/npm.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/npm.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"661030a7c4dd1a809742c5ba6762fed6a1a82b6e7a0db236b0826f72b3a61024"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard-envoy/src/kv.rs: engine/packages/pegboard-envoy/src/kv.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in pegboard_envoy::kv::execute at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard-envoy/src/kv.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/kv.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4b9dcdfd11ddd9f7125436b4b913c6a1193f2b44e8258b543176f9c8cfe24a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard-gateway/src/websocket_tunnel.rs: engine/packages/pegboard-gateway/src/websocket_tunnel.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pegboard_gateway::websocket_tunnel::proxy at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard-gateway/src/websocket_tunnel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/websocket_tunnel.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1289e98094f7139b93ab2832a89c73bc6972836b287308f648fedf3513ee8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs: engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in MigratorStateMachine::on_event at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard-v2-migrator/src/migrator_machine/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":"engine/packages/pegboard-v2-migrator/src/migrator_machine/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd18ad497a178d05a2b18f3261c63eda72d644c67d86fa2a274df4894a2db53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/services/storage.rs: engine/packages/depot-worker/src/services/storage.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in depot_worker::services::storage::run 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/services/storage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/services/storage.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f29fd9abddfc93943fcf653fb9a95bcaf86395fd80b5b2ab622836dfa60ec26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/filesystem/read.rs: engine/packages/depot-worker/src/filesystem/read.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in FilesystemStore::read_operation at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/filesystem/read.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/read.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4851abdf592c75b209483b8a61398095721addd19a11832fb44b7694849c1c69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/service-manager/src/lib.rs: engine/packages/service-manager/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rivet_service_manager::start at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/service-manager/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/service-manager/src/lib.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1657f8367bfc3397cc16912ec2a0caeaab4d15dd50652c5b0230c861e9e94e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs: engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in depot_worker::tablet_maintainer_machine::state::revoke_lifetime at line 1551. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-worker/src/tablet_maintainer_machine/state/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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"795d7822a44f07c504a7efba1b1d53c5dd159b12dd4e71b1b8496d698cfeb69c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard/src/catalog.rs: engine/packages/pegboard/src/catalog.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pegboard::catalog::pool_handler at line 1102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard/src/catalog.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/catalog.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7c52040d072d70d32cf286b0ab455e7b1b3a375a9788b58567ff7ad51206b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit/src/client/utils.ts: rivetkit-typescript/packages/rivetkit/src/client/utils.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in utils.sendHttpRequest at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit/src/client/utils.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/utils.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3271b735faec00767dc491d2dc5ad8ffbe2b19351b14e00b04713c55a3916ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/config/src/config/depot.rs: engine/packages/config/src/config/depot.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in DepotConfig::validate at line 303. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/config/src/config/depot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/config/depot.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d969b30d3bbe5689422eed29eadf8ad4449709f4d736c2b162f4f439191103f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/pegboard-v2-migrator/src/migrator_machine/executor.rs: engine/packages/pegboard-v2-migrator/src/migrator_machine/executor.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in pegboard_v2_migrator::migrator_machine::executor::run at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/pegboard-v2-migrator/src/migrator_machine/executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-v2-migrator/src/migrator_machine/executor.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b05c74e64e06f3760f517269a0256f89383fb313332b48de388ee6ab78611cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/topology/src/topology_machine/lease.rs: engine/packages/topology/src/topology_machine/lease.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rivet_topology::topology_machine::lease::handle_list_storage_workers_response at line 720. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/topology/src/topology_machine/lease.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b8f029e5432a186fd340e0234abdf9f361599c5b0588a31f2ffa0df4cdeb77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts: rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in mod.db 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"858c61b88932a2593a83fd0badbaa3695924c31b115edab4cecb0548e0eb446b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/publish/src/lib/context.ts: scripts/publish/src/lib/context.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in context.resolveContext at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- scripts/publish/src/lib/context.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/context.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"814dcde6348198523174571c9c73692e50c499c361c10876dbbca308596a20d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/sdks/rust/envoy-client/src/actor/http.rs: engine/sdks/rust/envoy-client/src/actor/http.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rivet_envoy_client::actor::http::send_response at line 656. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/sdks/rust/envoy-client/src/actor/http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor/http.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d5bce8b31fe6ca88453aacbf54ba2371d5ec6af5cee67475b62f2c7363b8a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/packages/depot-client/src/filesystem/transaction.rs: engine/packages/depot-client/src/filesystem/transaction.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Transaction::scan at line 776. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:42:40 -05:00\u0027 --until=\u00272026-11-11 17:42:40 -05:00\u0027 --full-history --no-merges -- engine/packages/depot-client/src/filesystem/transaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"937cc40f18673e4611d361709801fe5dfaa3d0c9b16b3189d6961e876bc7d722"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 57 significant file(s) lose their only recent owner: rivetkit-rust/packages/rivetkit-core/src/actor/context.rs, rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs, rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts, rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs, rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs, integrations/workflow-world/src/actors/workflow-run.ts, rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs, rivetkit-rust/packages/rivetkit-core/src/telemetry.rs (\u002B49 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"079455c07815727ebf1135adfda702c38a3bad26a1b1dd177ce9a66fa6a4ce4d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 6 significant file(s) lose their only recent owner: rivetkit-typescript/packages/effect/src/RivetError.ts, rivetkit-typescript/packages/effect/src/Actor.ts, rivetkit-typescript/packages/effect/src/State.ts, rivetkit-typescript/packages/effect/src/Registry.ts, rivetkit-typescript/packages/effect/src/Client.ts, rivetkit-typescript/packages/effect/src/Action.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6fce979853c70d494b53c77b0d8d372e6d3e31472c814d68b558a77e5e1d48df"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: rivetkit-rust/packages/client/src/protocol/codec.rs, engine/packages/cli/src/commands/deploy.rs, engine/packages/cli/src/util.rs, engine/packages/cli/src/commands/pool.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"118e844eacf4ece891e1d70fa14bb995f73bd740935427c19d7e7f4c8018669c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 3 significant file(s) lose their only recent owner: rivetkit-typescript/packages/rivetkit/src/inspector-tab/mod.ts, rivetkit-rust/packages/rivetkit-core/src/inspector_bundle/mod.rs, rivetkit-typescript/packages/rivetkit/src/engine-client/ws-proxy.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1dbaaac84c9f520e10e3435b6d35e2377fcae6bfccffba967bab8358978a3660"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 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 (73 single-owned of 865 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; 865 of the 1304 production source files in this repository met that bar). They are anonymized user #5 (3 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: engine/packages/outbound-guard/src/policy.rs, rivetkit-rust/packages/rivetkit-core/src/serde_metrics.rs, engine/packages/config/src/config/outbound.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Add Sec-WebSocket-Protocol header to fix KIT-339 \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":"rivetkit-typescript/packages/rivetkit/src/utils/router.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6bdabe9c851d43155788e45b7eb37a2653f609873f1ce58952cdd2b6a41ca0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Switch inspector routes to CBOR 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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"254eea7287579a2e6031660ff9e8f401c982ea48ebb50d0765e83f0018814346"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move this save hook into cleanupNativeSleepRuntimeState \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4928}}}],"partialFingerprints":{"codehealthFindingId/v1":"451ef0549158e3eb0cd8a98fed680f6057ef55d6c49e172d474c986e3069c2e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add sane defaults for NODE_ENV=development \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd860a28df30b637f8489e90b3378efd59d48b0f644e5f6138acb3ba2e0314f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a better way of passing around the test config \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"335a0863c0e8db054402a023a8a4c2b86ce47803f1beb7d40d49ab9b3675071d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d356171f870593a1da8137279a60a1189a68358daff6d1de4af1380058b3a904"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove getEndpoint, but it\u0027s used in a lot of places \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/api-utils.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b5ecfac3d463962ff754a9092650d6db9538d5ddb56a8662d0ffbf6f164ed8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove 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":"rivetkit-typescript/packages/rivetkit/src/common/router.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45f64d5ae3dcb194f1d32461b8275e46b8bdaa61a4ecd5b9ae15747d3d947c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ws message queue \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd12835af4a3d97636d07ee247eb9c1681fc181eff1c7f5b034781825a1789b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Throw error if disconnect is called \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12049f5e515d277ac95d6edb74bf03c29176d9a63bb9633c22dc467760a81fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RVT-6193): Remove this legacy match after structured restart errors"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecde1f575fdf1452babea5595951d2499397bae1467c359d71d6266f65c30936"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RVT-6193): Remove this legacy match after connection admission uses"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aaaac261fec28807c9eb5b3b08c1bd982f3653bb382fa2cf4e035732cb874d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RVT-6193): Remove this exact string match after the runner surfaces"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9229de92e85a45202306839381004f8a018b3877dd56168650d19241305a913b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RVT-6193): Remove these exact string matches after transport"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f681be153442b9f31c54ca64f76537ba299e91bbeede57a4211be54dbf49781"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Supportp rotocols \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/raw-utils.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd107dfed63492957508628382f4e005cb63398ca41aafe5892903aa9172fb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do we need encoding in rawWebSocket? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/raw-utils.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b454afc2a22be91eec1ea8465f0abe3105e1fe5b6710eee69e693857c030e834"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Impelment when ready \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/registry/inspector.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"96243ed1772fa61499519a852d671d68f3304837056754350da8924eefb380a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Share admission policy with ActorTask::dispatch_lifecycle_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":"rivetkit-rust/packages/rivetkit-core/src/registry/mod.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f335b17c6174a3b52386299d485edec7b887795f15501be7e07248b7bb6c6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Sample inbox depths periodically instead of on every loop iteration. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"114f2b85834d91eb4ce26b0c2a2422010e7c659384787a9c8638617c49539ef7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Share admission policy with RegistryDispatcher::active_actor. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b786b710b342f8ec868a5a7abfba129bde1bd3d8d7132729c6715728f6c6c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement SSE support via gateway \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/drivers/sse.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdf007cdfe7cc45b2b36f0caf69149cd9dc6f4ffe5c0e318acaaf294c61e685"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add more signal 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":"rivetkit-python/client/src/simple/sync/handle.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1726f3a78fbe2887586039f44860401637b9cc545cf3688ad49720d9a7624de5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add more signal 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":"rivetkit-python/client/src/simple/async/handle.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3c5e6bb748b41668aa2b59797eb93093c258450414a45ced3f0330882e971a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Bound shared WebSocket writer memory across protocol message 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":"engine/sdks/rust/envoy-client/src/connection/native.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab7a6ec9d17bc51d2f253aca908893d0235e76e81027faf8001b373587d3392"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Bound shared WebSocket writer memory across protocol message 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":"engine/sdks/rust/envoy-client/src/connection/wasm.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1168f492a715d8f9742a4130d1568cc394fa60aca46bd78a5fe07ac6b46f8553"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse all valid Retry-After formats. Currently only parses duration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/req.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"40346c53a1f708a79439587e58e0802188caeb1191c8d3f4e6dfa05b2d91c1e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This assumes every worker is a storage worker. Stateless workers also read \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/state.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ed10df8886dbe42644c33aa79ce4c489fdcecfbd7cd4eeb418e9f2b250bfb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also send \u0060CommandStopActor\u0060 for any epoch that is no longer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfbaf11e2741714227b64fedd5e4d8ce174aa23ea663483088a1d859f34ab31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: A pending write index effect can re-create the index entry after destroy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard/src/actor_machine/mod.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcce8170f0f20bd001fabc3ee6880d089de0c475a4a2150028b0e1faab16128b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Register topology heartbeat GC once a cluster singleton host exists. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine/src/run_config.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3252274e9a1e4bca5f5bfd6ea4b0f1e66cd047b3ffbb1fc247afd91f9fb54a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Revisit retained incarnations once assignment updates are wired. They \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/opening.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e323ffdfe1273efb933d3cd0d1db04800ccf51f37f07c1453dc488a785ed9b00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Resolve retention or cleanup of uncertain minority creates before releasing this unload. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd36660ac118233a0d67a9c104308d06a390b2f60e476fde6ce3c7db1ac66f83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this import. A split must copy zero rows: clone the parent checkpoint without 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":"engine/packages/depot-worker/src/filesystem/alarm_bootstrap.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167bbe651eb55db01d22c363fa9dab3a99f3f659308484fb2e911b925637f13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this import. A split must copy zero rows: with an unprojected clone the 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":"engine/packages/depot-worker/src/filesystem/alarm_bootstrap.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e7952a908842acfa44c6b09b3a291ecf176ab324bb67f9f8b33980a59057c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Request body 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":"engine/packages/api-builder/src/metrics.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ffedecd0d5ba79590c46adc8bdfa7e17f28fbde526e9f1b83ab0f7f17c62ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Response body 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":"engine/packages/api-builder/src/metrics.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a479ab9935d79909308cc86bd85284bea61b06ad113c95a5a5362c793c3091c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this since this is duplicate logs \u0026 traces, but this is just to see what Axum adds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-builder/src/middleware.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49fb17bb7972fb335b73aa09b13be2462c4d14bf5fa0d2b76f0380146e937c1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060rivetkit\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060rivetkit-typescript/packages/rivetkit/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":"rivetkit-typescript/packages/rivetkit/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f0b98ee6bedec2c5080e717fb17a1b6aac1f3f09c4f3b21a8d230a443e1933"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060darwin-arm64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060rivetkit-typescript/packages/rivetkit-napi/npm/darwin-arm64/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":"rivetkit-typescript/packages/rivetkit-napi/npm/darwin-arm64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4a543bffc38d5372454f8bfaf227bd26585fc43928611bac90ae42a519c6ba"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060darwin-x64\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060rivetkit-typescript/packages/rivetkit-napi/npm/darwin-x64/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":"rivetkit-typescript/packages/rivetkit-napi/npm/darwin-x64/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c2c2d93017c99b947f35eef63b5ecbdad74bb5b18498edc7759d2d3749c189"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-arm64-gnu\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060rivetkit-typescript/packages/rivetkit-napi/npm/linux-arm64-gnu/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":"rivetkit-typescript/packages/rivetkit-napi/npm/linux-arm64-gnu/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e979f371fc05f13b101dc1adb1cb01d509d3ac877bea62c48bae6d80765864b1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-arm64-musl\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060rivetkit-typescript/packages/rivetkit-napi/npm/linux-arm64-musl/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":"rivetkit-typescript/packages/rivetkit-napi/npm/linux-arm64-musl/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d010eb9296cfbba15b50b2ba5386687281205c1610aee2d75c8a97c78e7f49a8"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-x64-gnu\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060rivetkit-typescript/packages/rivetkit-napi/npm/linux-x64-gnu/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":"rivetkit-typescript/packages/rivetkit-napi/npm/linux-x64-gnu/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44b196d7b562e58d44d53ef3c3d3136924a8e25082d55701883c2af27e9058f"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060linux-x64-musl\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060rivetkit-typescript/packages/rivetkit-napi/npm/linux-x64-musl/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":"rivetkit-typescript/packages/rivetkit-napi/npm/linux-x64-musl/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5cf62470244e372b26d67509d0fce1c89e59926e52bcb959782b55ae4dd77a"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060sql-loader\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060rivetkit-typescript/packages/sql-loader/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":"rivetkit-typescript/packages/sql-loader/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9f1958c382199ae79bd6a05f7ebc03a5c2bf521c68d7a6d4b08aa81345553d"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060SlateDBError\u0060 spells \u0060DB\u0060 where 15 names in the project spell it \u0060Db\u0060: 15 of 16 names in project slatedb spell the token \u0060Db\u0060 (15 of 16; unit: names in project slatedb containing \u0060Db\u0060). Peers: slatedb.db_cache.UnownedDbCache (vendor/slatedb/out/src/db_cache/mod.rs:1000); slatedb.db_state.COWDbState (vendor/slatedb/out/src/db_state.rs:756); slatedb.manifest.ExternalDb (vendor/slatedb/out/src/manifest/mod.rs:1596); slatedb.wal.slatedb.admin.SlateDbWalAdmin (vendor/slatedb/out/src/wal/slatedb/admin.rs:19); slatedb.wal.slatedb.gc.SlateDbWalGc (vendor/slatedb/out/src/wal/slatedb/gc.rs:41). Rename to \u0060SlateDbError\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/slatedb/out/src/error.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde32dc4f6c37c6af5b5fadc17aca0d09fd3e8e58734773299531386f82730e4"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060toolUseID\u0060 spells \u0060ID\u0060 where 496 names in the project spell it \u0060Id\u0060: 496 of 498 names in project @rivetkit/engine-workspace spell the token \u0060Id\u0060 (496 of 498; unit: names in project @rivetkit/engine-workspace containing \u0060Id\u0060). Peers: RivetClient.actorsGet(actorId) (engine/sdks/typescript/api-full/src/Client.ts:470); RivetClient.actorsDelete(actorId) (engine/sdks/typescript/api-full/src/Client.ts:530); RivetClient.actorsReschedule(actorId) (engine/sdks/typescript/api-full/src/Client.ts:601); RivetClient.actorsSleep(actorId) (engine/sdks/typescript/api-full/src/Client.ts:672); RivetClient.actorsFork(actorId) (engine/sdks/typescript/api-full/src/Client.ts:746). Rename to \u0060toolUseId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/kitchen-sink/src/actors/testing/load-test-agent-2.ts"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"582132a9c079690127ca41ad402377dce546f7fc4516d8b939516fd42159c55a"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060sendJSON\u0060 spells \u0060JSON\u0060 where 26 names in the project spell it \u0060Json\u0060: 26 of 27 names in project @rivetkit/engine-workspace spell the token \u0060Json\u0060 (26 of 27; unit: names in project @rivetkit/engine-workspace containing \u0060Json\u0060). Peers: engine.sdks.typescript.api-full.src.core.fetcher.Fetcher.NonJsonError (engine/sdks/typescript/api-full/src/core/fetcher/Fetcher.ts:37); json.toJson (engine/sdks/typescript/api-full/src/core/json.ts:8); json.fromJson (engine/sdks/typescript/api-full/src/core/json.ts:22); index.readJson (engine/sdks/typescript/envoy-protocol/src/index.ts:24); index.writeJson (engine/sdks/typescript/envoy-protocol/src/index.ts:28). Rename to \u0060sendJson\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/kitchen-sink/src/actors/testing/slow-reconnect-actor.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"818e9686e9deef36e1ab7bb2fa52b8e9dd4ec6f2a30b1bd24ee50347ddf8d9dd"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060toolUseID\u0060 spells \u0060ID\u0060 where 496 names in the project spell it \u0060Id\u0060: 496 of 498 names in project @rivetkit/engine-workspace spell the token \u0060Id\u0060 (496 of 498; unit: names in project @rivetkit/engine-workspace containing \u0060Id\u0060). Peers: RivetClient.actorsGet(actorId) (engine/sdks/typescript/api-full/src/Client.ts:470); RivetClient.actorsDelete(actorId) (engine/sdks/typescript/api-full/src/Client.ts:530); RivetClient.actorsReschedule(actorId) (engine/sdks/typescript/api-full/src/Client.ts:601); RivetClient.actorsSleep(actorId) (engine/sdks/typescript/api-full/src/Client.ts:672); RivetClient.actorsFork(actorId) (engine/sdks/typescript/api-full/src/Client.ts:746). Rename to \u0060toolUseId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/kitchen-sink/src/actors/testing/slow-reconnect-actor.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4647d22f8edbc968deb8956d10486ad82267f9566cd6a526ef4e0873a4c9e201"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Increment ref count\u0022 repeats the code it sits on: 3 of its 3 words (increment, ref, count) are already in \u0060cached.refCount\u002B\u002B;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/framework-base/src/mod.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"36004bcfa89338edf5d6a496af8f90612d7416dc7c9bfb3ebf053bb9671336eb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if this is a scheduling error\u0022 repeats the code it sits on: 3 of its 3 words (check, scheduling, error) are already in \u0060if (errors.isSchedulingError(group, code) \u0026\u0026 this.#actorId)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c998cd394245888f6c837eab7ec15c34344c55ae495566d907c131e5005b87"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Open WebSocket\u0022 repeats the code it sits on: 3 of its 3 words (open, web, socket) are already in \u0060const ws = await driver.openWebSocket(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/raw-utils.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a28556d21c780a2b07f77172af27ac40badf1b3da5142cc14dadafcd8e4460"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create WSContext with actorWs as raw\u0022 repeats the code it sits on: 5 of its 5 words (create, ws, context, actor, raw) are already in \u0060this.#wsContext = new WSContext({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/inline-websocket-adapter.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c22a03afa65b0ad2c3ddf0cf4b8d0ea2fbb29211df653933fb32edc6e62ebbd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create WebSocket\u0022 repeats the code it sits on: 3 of its 3 words (create, web, socket) are already in \u0060const targetWs = new WebSocket(targetUrl, protocols);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/ws-proxy.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a546c9b928a9cdd467072fed16fd25641a38a31238818bd8ce9d03e2605ad808"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060engine/packages/depot-worker\u0060 (83751 LoC, 292 module-visible types across 16 directories) overshoots its size bounds. 5 of 90 build unit(s) (Cargo, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.9/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":"engine/packages/depot-worker/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff218f22a851cc8ab8f33a6dd4e2a80e3debfc3010be80919e213ce4df4878ae"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060rivetkit-typescript/packages/rivetkit\u0060 (33954 LoC, 422 module-visible types across 23 directories) overshoots its size bounds. 5 of 90 build unit(s) (Cargo, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.9/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":"rivetkit-typescript/packages/rivetkit/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14161f6f55c96a434359a9eca0aa171a96fb09e9d0d9b194f2ba8381a938b82"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060rivetkit-rust/packages/rivetkit-core\u0060 (33930 LoC, 177 module-visible types across 10 directories) overshoots its size bounds. 5 of 90 build unit(s) (Cargo, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.9/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":"rivetkit-rust/packages/rivetkit-core/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb64fc25a3a3cfbf6cc84e738b4371c6e339d8c963d0c86880346fa74c154463"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060engine/packages/pegboard\u0060 (19789 LoC, 178 module-visible types across 5 directories) overshoots its size bounds. 5 of 90 build unit(s) (Cargo, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.9/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":"engine/packages/pegboard/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f09f68a1e8565c2ed56140247dafc5c0c8586cc58805928b21bd74e039a5179"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060engine/sdks/rust/data\u0060 (16661 LoC, 225 module-visible types across 5 directories) overshoots its size bounds. 5 of 90 build unit(s) (Cargo, SwiftPM, npm) overshoot their size bounds, lowering Project Cohesion to 8.9/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":"engine/sdks/rust/data/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd43a8a5abb05548332e8b5fb59963fa9666eb3d3d0d44be07c0a172943803c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73c0e02f8368c06c20fc9fee884b34d401b814d970059a1d18b37d68fb0e2452"},"properties":{"commitSha":"f3c07c30fca491b912c215f7ae3d56be9bcaabb4"},"taxa":[{"id":"CWE-321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17465aabebf58e0ed6f11c356651c6fc17a07068b0587ede9278adc2cf59a3fe"},"properties":{"commitSha":"f3c07c30fca491b912c215f7ae3d56be9bcaabb4"},"taxa":[{"id":"CWE-321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3f13cde26b129ac187fe91782ed29e28212903620ff35e19261d54c36ff8da6"},"properties":{"commitSha":"d4b80f69dbb1f18d10cef603398f5b381586719e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bc883385c5fefd58f1a806119a0ef1e0cf6db475559b4ca1e4bce946ae7f001"},"properties":{"commitSha":"a7114082b307db50bea3aab73520a0781275a672"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6285b994da4311e21991096836e73819c57e02f72258b6d6ccb1d743cf8ff99"},"properties":{"commitSha":"f8ff424491ad52445825808d04dbef299aef735e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0e1ebebd7a881966583948950996ef6cfa8884a2207e020e4b376b2bfefbb7a"},"properties":{"commitSha":"d4b80f69dbb1f18d10cef603398f5b381586719e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17f3738b2344fb515b7fbb182775abaee27313ec9ef94caa5919a2aed676b589"},"properties":{"commitSha":"51cd729349de7720b5cb1a0419907c116d277ada"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e225195aaa04c8f4b9ee0f78579fd706cfadef3f22878b5a4d14f069f598ae92"},"properties":{"commitSha":"2d869d5013fc2c2ff9d834421711433842bcb370"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e10c311682148babe10904a04ed59362febb198e9791bfc003904a41108e45f"},"properties":{"commitSha":"f8ff424491ad52445825808d04dbef299aef735e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"009eb686379b31cb367226ad4faca60bbfe9ccadbc808ace9e800bfc8c2f770f"},"properties":{"commitSha":"f8ff424491ad52445825808d04dbef299aef735e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42c39966716a7977b80855e2d9743d410dfeaaa6f4a265772bc82058bb3189cf"},"properties":{"commitSha":"f8ff424491ad52445825808d04dbef299aef735e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c4c6a9c99fe7250d281ddd96e58c328fac458706cfa74c180c8335134747e3e"},"properties":{"commitSha":"d4b80f69dbb1f18d10cef603398f5b381586719e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f15a5e85a6638475a1ee6f6bd56c62dba805792eecbc45265afba4cf235c8279"},"properties":{"commitSha":"f8ff424491ad52445825808d04dbef299aef735e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f9a76fb0b130bc0b5eb74381d0d3af4ec87f67f04f6357319e9760b9dcfd44d"},"properties":{"commitSha":"e5170a5b15cf05220425ce6fe4e8d6219996445b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc5a853d85e862b80e8cdc7ce68099a338fdf6869487285c14d0e524cb587acd"},"properties":{"commitSha":"34422ea93d890c6847110859684d8e9c461b810b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70ebde4dcf4c8df9505506559f221efea5d88cf2c2867703ceb7850f915693dd"},"properties":{"commitSha":"34422ea93d890c6847110859684d8e9c461b810b"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a249d96dc31a2d26429c126d6898457500b4ba612c00b32ef6ce64edbec62de"},"properties":{"commitSha":"ac5de3ec07faf771bb2d2ac0babcaf3c0c755e97"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37531c35d070230b248e0713e67e9039b1be77cd6c0937ce8ccd96c1a38f27c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2612dbdc08234e82be6429a3c8591d8d66544e956b75e85344015af3f7277180"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"932d6f7a550ba6dae6e082777b7c6a1c4c01ab2dfc29912697086f4eb773f6d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8303db16945a563b65f21340cc9929f2070a35831fc9d6a8bada17a945df9719"},"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":"61882cbe17a694c2e461787e99cfb9483432db7ddc279eb4a6c065b62b30c21c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10c56a38858357ca9e1678c77c6b09a50a04b3f7d5c5aa9d458ffd15a74a7c6a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f59b8a83fe4db5d95cdda29eb7db13adea9f8b2f574e5eddb03417851bb3c67e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49e9df15abb5f92add0830591936c7eef68c563b22208cadcbe80ba32728ab96"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2bbf4db0c0e09606afc98b04e17df3bfe887cdfdd807d54822b0c9b8316e441"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0957cc7f47d1931c56662464cd3ce406765637560a7f96e94ab37853c0558962"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a507b25ae9d4b378128e0c4feb16921bd33912d8a11fc031bec7bfcc8b21a2dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a38410c0da21a6735db5fb4372a94b9ef370d85c2f22370cc95280e1630d1d9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b534d8fa1ed9d9b2d0481141255def1e52efaf06301db9c74a82fb5fe8d70ae0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e4362509d5aaf34bdcc9be64b3955dc3a939310b412771044b3af85f4770b6b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f30aeb7e1b0749aaac6bb5f10a835cb8951ac671f0b58e0f7294c946ee71dea2"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c73686409ba4c645ed31925b409692ccd05a6c93daa2d26b3e344f66a0513474"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0a42980f5f7d1d0345135eeedca75e6ab3e7379b5c76a65b7a6d93b71b84d14"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31e9a591cea22ffe183fc654f525d3e997e76323a619a7ec43cc6cee65bda722"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e1c34f50998dc22120e44ec9eab02fb1970217d27d7cb46e2e04a704e8bf124"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9cc13327ef4c3a0b4236e05f77bcd032f8860287c6c09833c59fabc3ba9188a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e17efe3080475827c901ca6715a0cfb4f81bf0c8f991bd344775dfbe8e4bc301"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e73656814c72b6fd26336a9661586bd078722377085e6ab3eca2c78e0772c38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dca9ea75fc0f16db0a4d9bd0f49624aa55733711ac5169feac535e5ce3665d39"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1bba645de22e0638cbd49e64843b15d2a262807daecdd2671ce4d7e82622161"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba6edc91fbbf366716eabfc2234d8fa54e0225ce77b2f4a2c4898d0ee1ea0b80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6891a4e1a5f123ed29b5e7b478d7d62b822cce453d3bd63bc8ed2f45da8434da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a8a4684d38e7b8030617cdc43b0c814f60f94693392144e6f434871b63a93ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4574b4182ec8df488481f3adb664e2fbf659035ce0350fe8e17ee44b7a87d0d8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"516926911dfd3af5a4fdf18d361d8fe6862ce62eeed04dc072efecf31720d9d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"774926130c2a3a9e6f5c48ffa85eff7ec285db59ac17a6d5376e35594e2fe243"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4fb4e9e82f99aca40458a17f254e86616ed6b896056d35509b23c83026fbc46"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ffea88679679727de53c1bf5749ebe1e3fe36590dce9d03b9ea14539c319e26"},"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":"3c190c5cf82ee3ea495262a9a12bc61d5b832efcc07c8f3bb6fff65004db91c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f83f1a7b6ac294f5ee74662c79b0c2592f1b55c32bf6f9a723d5a003f998a4c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9d59ac9aad93273d3071bb14c604daac0ff9b805ff21c480e0f17156d6a9747"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bacc60546bbeae4ef323bd5c710d9aac95051bea3605cb28d91adadc648ecfd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3a6b4b2cd08dfa4179c37dc7254a9e86c1979684f72a28c3a530e259df71b73"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f08b03b3cba9697ecb0d8f084f2376b19fdc3860cb5f89e5c709b9d7f5d0bf3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"489401bd9e978039f83ee93309a8af92689e6cccff5c81f3c9f4995322c20a07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d27778e4681da95908704f4c0e6517c8143d1ab589dd703839cbeb2c422bcb9c"},"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":"e732739fe805746267a10810f3ca01ea77a790d79201f55aa42fe890c84ca3c8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"522900f428eba7fbf14609c73a2949c767a414b12233028014c97810852febee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a437e04fee0bc83aac1712045ded313bb60756be978cf036e3eb2abd99fd0eb3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3de372a928d3a67a078c06e50e38de3ad29d1e5b88df7118f2f372cb83b58735"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb35b3b04b423b8636df17fe1806928a17c8642913e13e989fc644351af6f706"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0807a51492fa8797be3f350c32100c9bd2b6f5a633b7df131e0e6124bf83c8a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f89c7b84a5607cddc6db82fe3073a792fe03fab8b3e07e45ee524cf9cb16e6c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"320c31211c3cb80130eee85c5f1fad156e0b07f1ebc251cec5cb6d6de8a09d5d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9547ffe1fe450c6c27db818620d208444635fcb2b5e8020d78e0fe53a6e209e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"891fa081c17c25e18854967ff1ac897ba94bd8200ab15d8a454af86ad158a21a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89bb37b903bc30f61450a2205ec954e925681e960fc56e28dec9f39c9a5a6c25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92df06dcac64ff14553fa03946d47981e9f11ec92cc4f978b14895ab958b0501"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ef5a0aae33f2e29951864bb709b4827d548b7614fbc3028c88a99fd78b14135"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9734479c1036653b707648b7d050fed25524c6c760ecaf95dde916fa355fdc4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52981d90d41d96730042c6dd89266edd1bef2319c5cc27cb68be46a6c3e237fe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e10a499b788e0971809f54dc306f1aafa5ec956bffb4808e0be61a723c1b621"},"taxa":[{"id":"CWE-89","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":"c7da5b6174dd559b07a9aa8e03a300be11a81e0502180d35bdccc9c3a57ee326"},"taxa":[{"id":"CWE-89","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":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"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":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"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":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"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":"d6b2a7127fa518fd05ee22c18496a41323bbf8529542a253923c6cb860372d96"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"0db0724e9f8c48ef9744de27d6305712da3089828347a2ddc534ff22d0120044"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"527576b9a65407806963887ba59dfbd1633e007cd361ff937cb520be4e9b045c"},"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":"48bc4cd34bef5cce502415d0d18d5aeaf058df696148cb2a503ec0f830c5fb38"},"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":"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":"8bfe269a7afa8ff6a9922d53db659b39daf13e3f65a436c0a3fd06d94364a035"},"properties":{"dependency":{"package":"better-auth","version":"1.6.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"1.7.7","relation":"direct","declaredRange":"1.6.23","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":"e211c07a903d64d26c2fb727e6caf4e42a2af0f022750dc7a4d93efd075375d6"},"properties":{"dependency":{"package":"shell-quote","version":"1.8.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"1.8.4","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":"839538a3076f3c7c22d03c79de917c0d63ad72fe9f32b488c24d30946948b293"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"2.1.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":"a57029dc9cd426ff9bfddf50e89427c84238e4679a53f3d2a6d17acddb201986"},"properties":{"dependency":{"package":"vitest","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"3.2.6","relation":"direct","declaredRange":"^3.1.1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c512bee24de8da68ed288ad4871f0b7585a66025a9a8d1b6550f8e5b5b4ed038"},"properties":{"dependency":{"package":"@xhmikosr/decompress","version":"11.1.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"11.1.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":"a585d014729ffa74ba563a02099225a26e0cb5b1eb41d0d87d928941d506bef0"},"properties":{"dependency":{"package":"elysia","version":"1.4.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"1.4.17","relation":"direct","declaredRange":"^1.2.25","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":"c121aed0fdd9c8edaea4f7b45c2a2b359d48bddf2d4dcca7a065482037b182b5"},"properties":{"dependency":{"package":"handlebars","version":"4.7.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"4.7.10","relation":"direct","declaredRange":"^4.7.9","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":"80df8081b3c2f9821b94e4e3c4358a1412424c0c1935c2d9651ea88c4f23104a"},"properties":{"dependency":{"package":"next","version":"16.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]"],"severity":"critical","fixedVersion":"16.4.1","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":"e253d4fba1677ed02154d7dce120d1a5e855398223a929be77cd557cdc03fbd1"},"properties":{"dependency":{"package":"piscina","version":"4.9.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"4.9.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":"cfd6c07cc7bff03297537b0171241ce48b166913da00cb8d31accb695587d98e"},"properties":{"dependency":{"package":"protobufjs","version":"8.0.0","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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"8.0.1","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":"e5533c2d149eea07ed065c5fde61196816d01a4a3eb50ba7bc43ead963babea5"},"properties":{"dependency":{"package":"proxy-addr","version":"2.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"2.0.8","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":"29827ff1862f4841c892ec8b8867f048f1bfa9d96110dfe90e22961d0aa8306d"},"properties":{"dependency":{"package":"shell-quote","version":"1.8.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"1.8.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":"64817b26bce4caf686ef1ed996068f9a778c7d72e0be66ddef1ec3ef5f8dc9a4"},"properties":{"dependency":{"package":"tar","version":"7.5.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"7.5.19","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":"d74aeba34c20ef883320d58ae3a9ebc2ca37676b56ad245f77891a27afcd5d2d"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"2.1.1","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":"6e73274327a59fde3d7525c32eb900b994ffa4778e21ba83ba71c18747bd32c8"},"properties":{"dependency":{"package":"vitest","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"3.2.6","relation":"direct","declaredRange":"^3.2.4","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/src/test/mod.ts","line":1}}}},{"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":"c6ba8c08c6c857050abec6b82f02e30663e9900ffbfc84c6363da71f6675b2fd"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.19.10","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":"9d5420ad52cc238276baa120b99f7fb28f962dd92145313c99d79d267d022f26"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","relation":"transitive","reachability":{"kind":"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":"1f46154a44154e9863b52446f81705cb6d752921dc71056bc274f7cbf941a9fc"},"properties":{"dependency":{"package":"hono","version":"4.11.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]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.11.4","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":"02f2707d031b1c667daf2b16da8e7366b25ebaa374a95fac81f21196103e19f3"},"properties":{"dependency":{"package":"lodash","version":"4.17.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.18.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":"376c4c39fae3ccd4356b3eb8847e9e857cc9d311a242cb43bd632344eafe093e"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","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":"627ed8f1f61520fbf8f3d934e65b73d65686683cf3f660629fca5fb4043ff869"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.0.4","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":"f8e65fa3de5e88e67d974615efa58c3ea849ab5e80d4e48a64206b53bede8eb7"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.12","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":"b94d061e02095526b0621e3866a0158c3027a15112ec28fbefd584f459814a0a"},"properties":{"dependency":{"package":"rollup","version":"4.55.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.59.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":"f8881f6429c99be3792b13312d8e690e04268fd1f7bd063ea8b6ad91a9d0c93c"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","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":"c1727417b9f5b8eaa41cbf0cf5ac29a32113e06ab3bd28b35109ce0c9d75c23f"},"properties":{"dependency":{"package":"vite","version":"5.4.21","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"6.4.4","relation":"direct","declaredRange":"^5.0.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f63a8a8ccf3da03663b7edb6e95549c4fee62c9e2e5e2543614f8e5fcf3af99"},"properties":{"dependency":{"package":"ws","version":"8.19.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.21.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":"d5385b1320c139a7d0d8c757e8f3edab00e0128aac4cc44884deeb8c5607338e"},"properties":{"dependency":{"package":"zod","version":"4.3.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","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":"4902609f9f7ce26a50230b0eb4ef18485b4e1602c0cbf966db51f07a7f265f10"},"properties":{"dependency":{"package":"@grpc/grpc-js","version":"1.14.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.14.5","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":"a788030a15117424fc2e960fd04cd5deebeacfe9eebd875065196d712972eeab"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.19.10","relation":"direct","declaredRange":"^1.19.9","reachability":{"kind":"test-or-tooling","file":"rivetkit-typescript/packages/rivetkit/package.json"}}}},{"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":"e6369c49294a116dc3113d4593de258dc05875a69494f5f0cd0ad6c370479c0a"},"properties":{"dependency":{"package":"@modelcontextprotocol/sdk","version":"1.29.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]"],"severity":"high","fixedVersion":"1.32.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":"ebd07db18387087e67f9e845220aec719ccd37d9d14a5391220446f8e7a54857"},"properties":{"dependency":{"package":"@opentelemetry/exporter-prometheus","version":"0.211.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"0.217.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":"cda4a462449bfd942fc0dd2d20c5fe93e636fe7c0964cb58dcb0f5954dcc1c69"},"properties":{"dependency":{"package":"@opentelemetry/propagator-jaeger","version":"2.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"2.9.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":"4627d31bc6ac36b10371bdac5dc7ecb340b4643f5cdb6039099d4000dc4e3d10"},"properties":{"dependency":{"package":"@opentelemetry/sdk-node","version":"0.211.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"0.217.0","relation":"direct","declaredRange":"^0.211.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2eae5ae78d85cd537b0fb3020ddcfb60e7b62739c2b4fe6fee05aac434877c13"},"properties":{"dependency":{"package":"body-parser","version":"2.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"2.4.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":"75a9824bece649befab9c819bd9a94f3d4a4151a27f6d9e1993b36dc9a17af5d"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.12","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"1.1.16","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":"9b69abb950280fc9b12a2418c7a6a0d07be924818952097fe2916b820a759d69"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.2","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"2.1.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":"621ed240b53756f1715c39ea827332e52340e8783fec1519db854e508bfc426f"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.5","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"5.0.7","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce9bbfea95fe015374ae86e03b9373fd15c82feee84c4ee070b765207d8d9476"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"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":"87bf22458bbad221d5e85a4dbea6e17669e1e9d377f6bff36f1bc9a25e3401fe"},"properties":{"dependency":{"package":"compression","version":"1.8.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.8.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":"718f34ffa08f9ba329ae50eff5e3c2d3716b8aa0ae4bc1e7c359227f7016a7f4"},"properties":{"dependency":{"package":"devalue","version":"5.8.1","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"5.9.3","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":"f88fc00ec7861a56df42bb26114ca872e3309402838f7cfa4c001103d41b71a1"},"properties":{"dependency":{"package":"dompurify","version":"3.2.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]"],"severity":"high","fixedVersion":"3.4.17","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":"91c24e70a6cc848498bd19db1241db5dc5ff54fe1a9e5e9cc3c1fe4468331a29"},"properties":{"dependency":{"package":"drizzle-orm","version":"0.38.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"0.45.2","relation":"direct","declaredRange":"^0.38.0","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts","line":1}}}},{"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":"77ec277c243e10ae6c40ca99d4ae34fd568b32d7cf8c1f0b6e5b8ed0b7a91988"},"properties":{"dependency":{"package":"drizzle-orm","version":"0.44.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"0.45.2","relation":"direct","declaredRange":"^0.44.2","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts","line":1}}}},{"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":"06593c39ce911a216ed914a471d9cdd931bac450d9675076e44dd756bcb35a60"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.0","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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.1.3","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":"01fc85053279d115ea033564d5712283763a31a120ba4ad4775e78b10049b1a1"},"properties":{"dependency":{"package":"form-data","version":"4.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.0.6","relation":"direct","declaredRange":"^4.0.4","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":"3df0d1d450878a54d77d4bfdde6e3c0daeb7ae1abdc6433b96bc665241291e5b"},"properties":{"dependency":{"package":"hono","version":"4.11.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]"],"severity":"high","fixedVersion":"4.12.25","relation":"direct","declaredRange":"^4.7.0","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/src/common/actor-websocket.ts","line":1}}}},{"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":"691b7e2bf95c8af84df5ce832211dd11cd5da521b87c95df1fe446031c2b4fca"},"properties":{"dependency":{"package":"immutable","version":"5.1.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.1.8","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":"685cba4514570b53bf9bc85812fa54c07fec7b3f62fc67d4712c038e9ec2e605"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.3.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":"5402c61ab90b9ddad6879ac5cbcbc5f93a1ff01d4f5bcbc090a44fc5eca4c817"},"properties":{"dependency":{"package":"jsondiffpatch","version":"0.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"0.7.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a3f4b3b7af346e33936bd7e2e6896389cc6784b86562fb9d652eb1a21ee73ff"},"properties":{"dependency":{"package":"lodash-es","version":"4.17.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.18.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":"ec9cdb1c98f8012dcae275dd9d8f2ebf8e72a8d2cedc0672bba807d0182d5906"},"properties":{"dependency":{"package":"lodash-es","version":"4.17.22","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.18.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":"380e9775a99b766fe55fc7798386bd61b90dff7051cbe0f82cb4363fd66785c3"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.18.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":"3dc861f255786951d473c9616643983019a4e002e32482b485841b37be445565"},"properties":{"dependency":{"package":"minimatch","version":"10.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"10.2.3","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":"74e0012f1c6ced1997b0505de62aeb84760d70f962e4f3f55eeab0b38ef9acbb"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.1.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":"ed90783cf90c9659a014a69fd4b9603093235ebe79fcac5b284ded7c5c4771b8"},"properties":{"dependency":{"package":"minimatch","version":"8.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.0.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c78b7242107ee3f49cfcd6a443dada01b930d584fabd805e83494ac3d42ff1d2"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","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":"6b119d517ff16b1edbc441e60662a8065e02e36cc86ecac75b87b22cc76a3fff"},"properties":{"dependency":{"package":"nanoid","version":"3.3.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"3.3.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":"3f0301fc2e87619c850b71379b43db169c1dd38ad826925413ec403095f30929"},"properties":{"dependency":{"package":"nanoid","version":"3.3.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","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":"75b78596deca2f63e59f912c25163a429b4a4ca20ee440acec1c9202c45e33c0"},"properties":{"dependency":{"package":"nanoid","version":"5.1.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.1.16","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":"5766748c73d55028d576ffc5ab75d4a5a74d8210ceb7a55c003bc7ca528dee7f"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"2.3.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":"c242db356716cb731e5f78939bc88dc2a5925018a15421c0dd20d898de667300"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.0.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":"5c043f9f04f9184ebae83aca70f60592046bd011e9a1cf05462bfb7cd4493fb5"},"properties":{"dependency":{"package":"postcss","version":"8.4.31","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.12","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":"2e1be44f0a3c4f1b66d5ebcb9bb069175e5ebc0cd8bd737778f1a6bf29979ecf"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.12","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":"20b1f1eaab84667c535410e824c5b32850491cb68651da08c7e3e7d497031a80"},"properties":{"dependency":{"package":"rollup","version":"4.57.1","advisory":"[CVE redacted]","aliases":["[GHSA redacted]"],"severity":"high","fixedVersion":"4.59.0","relation":"separate-copy","declaredRange":"^4.62.2","reachability":{"kind":"unknown"}}},"taxa":[{"id":"CWE-22","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f538739e89f76b0971a5390fa8cddbf706f34980e213deea9c68f7ff3476760"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"0.35.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":"3dae02efd4a19e70cfc4f7b9f8206dc9e35e058d135bf49ebbe5dd0128f7f56f"},"properties":{"dependency":{"package":"sharp","version":"0.35.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"0.35.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":"b9e6ed2f1c3b9d06c1ae728ca0754a134c8b09e532a74b14e5e76708e01e4c58"},"properties":{"dependency":{"package":"smol-toml","version":"1.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.7.1","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":"0bf997523edcbfd004b0e48079d2d03fc36b5b8058c165442d7b3299bf52fe16"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.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":"419fd1f043b7157808690580136f21e6b822e94314fa7783bef18875062bff3d"},"properties":{"dependency":{"package":"undici","version":"7.24.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]"],"severity":"high","fixedVersion":"7.30.1","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":"2cf1c79eea478aac7305b5f2e39899282ace0d5f26c39c569c71ad1647d013b0"},"properties":{"dependency":{"package":"undici","version":"7.28.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]"],"severity":"high","fixedVersion":"7.30.1","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":"d45f7302e9e48a499ae6c3006159340a1daa3b77b0dbc0856c8ae9a80063189e"},"properties":{"dependency":{"package":"undici","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]"],"severity":"high","fixedVersion":"7.30.1","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":"add172ccf52fe2012cfdeded6aee15e3bdb1f18d8e5f205f2a1525166436ddd4"},"properties":{"dependency":{"package":"vite","version":"5.4.21","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"6.4.4","relation":"direct","declaredRange":"^5.0.0","reachability":{"kind":"test-or-tooling","file":"integrations/workflow-world/package.json"}}}},{"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":"b382de9e713f41301835ad1b9a9ec123e9c7dcf645a590d6d543031f8253544c"},"properties":{"dependency":{"package":"vite","version":"6.4.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"6.4.4","relation":"direct","declaredRange":"^6.0.5","reachability":{"kind":"test-or-tooling","file":"integrations/workflow-world/package.json"}}}},{"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":"98f111f59c930fdbf1fdb28f959dd168a7ea13142fa6e934b485f1f4d4324bd2"},"properties":{"dependency":{"package":"vite","version":"7.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"7.3.7","relation":"direct","declaredRange":"^7.0.0","reachability":{"kind":"test-or-tooling","file":"integrations/workflow-world/package.json"}}}},{"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":"8160ebd5146ab24e016fe86d08adfcb96915af5803b49251445840509cbe1ed5"},"properties":{"dependency":{"package":"vite","version":"8.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.2.4","relation":"separate-copy","declaredRange":"^5.0.0","reachability":{"kind":"test-or-tooling","file":"integrations/workflow-world/package.json"}}}},{"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":"f2a71ef6f650e6321577e7a7dea6b58b6a54cc6e279590dd246ba386fa1d17c4"},"properties":{"dependency":{"package":"ws","version":"8.19.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.21.0","relation":"direct","declaredRange":"^8.16.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14c6ea47d4e2e1d4a6fc0369536f58a3da92cfc4b784e916193f47acded9923f"},"properties":{"dependency":{"package":"ws","version":"8.20.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"8.21.0","relation":"direct","declaredRange":"^8.16.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ebef2b165f22eaf35d99f757d2c09492d940967fea1af61fe4f535358dd0edf"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"direct","declaredRange":"^3.25.69","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/scripts/schema-utils.ts","line":1}}}},{"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":"065fb72b02abd5bf47997a25901b841b127c4777f58057d42b33681966894ae8"},"properties":{"dependency":{"package":"zod","version":"4.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"direct","declaredRange":"^4.1.0","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/scripts/schema-utils.ts","line":1}}}},{"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":"b730ecbb5716e43e36f4b0d9370e3c4a24130b0124fb47a7e6a0c29ef5df050f"},"properties":{"dependency":{"package":"zod","version":"4.1.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"direct","declaredRange":"^4.1.0","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/scripts/schema-utils.ts","line":1}}}},{"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":"1110b0a63ddd5b0d429d3153debbff41bdd3b28172f071dddb879384de74148d"},"properties":{"dependency":{"package":"zod","version":"4.3.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"direct","declaredRange":"^4.1.0","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/scripts/schema-utils.ts","line":1}}}},{"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":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"severity":"medium","fixedVersion":"0.39.0","relation":"direct","declaredRange":"0.30","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":"525150c79769e3a8552e1d639a767bc181c181d5c769963ba9e0faa9d03741e3"},"properties":{"dependency":{"package":"opentelemetry_sdk","version":"0.28.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.32.1","relation":"direct","declaredRange":"0.28","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"551ec82dfdc8bf5da0e29515778a3b34f4c4bb5028648944595fc6b8f8934376"},"properties":{"dependency":{"package":"serde_cbor","version":"0.11.2","advisory":"RUSTSEC-2021-0127","severity":"medium","relation":"direct","declaredRange":"0.11.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":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","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":"240be77958a56b49fb29e9cf176993285e9a804b8aa770b9cedad89b3e6148d7"},"properties":{"dependency":{"package":"adler","version":"1.0.2","advisory":"RUSTSEC-2025-0056","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":"f4822b3253d64f40dee3d890f302fa7305838168f787e44000513de5e6111bc0"},"properties":{"dependency":{"package":"anyhow","version":"1.0.86","advisory":"RUSTSEC-2026-0190","severity":"medium","fixedVersion":"1.0.103","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":"19ea439b4c61f2b5a9b39f6ffb0eb4b1893a1b0dd92bf71679764a28781fc610"},"properties":{"dependency":{"package":"bytes","version":"1.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0007"],"severity":"medium","fixedVersion":"1.11.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":"8aefa30fa8b070d98ad25d817d80a0a8228bb81dd5f02988ab88f99725540787"},"properties":{"dependency":{"package":"crossbeam-channel","version":"0.5.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2025-0024","TROVE-2025-013"],"severity":"medium","fixedVersion":"0.5.15","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":"e92b6fbdeac8c3bbccdc65673308ae8e0d5e7cf1a415f2dc5e7faf97462e4f49"},"properties":{"dependency":{"package":"h2","version":"0.3.26","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":"d40fd11f4963e396b882402929ed87f555a34724c20ac73b11fa6f2b4b3cb9b1"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9f2bf5977f091c5d3968e3cdfe41332f541c2def6b8cfc0f722e927aa69bb56"},"properties":{"dependency":{"package":"protobuf","version":"2.28.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2024-0437"],"severity":"medium","fixedVersion":"3.7.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":"f04e6723ab68c482501fa719a6a27d2e23d6bfaa8bc479708317ae3deb8078b0"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.8.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":"8542dbc7e3450d038135b4c0dc111cbed18f8a0cacfe3141bac25023acb7aad6"},"properties":{"dependency":{"package":"tokio","version":"1.38.0","advisory":"RUSTSEC-2025-0023","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.38.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":"2b2bc1c098d8dfa6972098cc130a4736010ed27fa5c6d6607f9a502caa694489"},"properties":{"dependency":{"package":"tokio","version":"1.38.0","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.51.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":"fcb4299362ce3b683014eb07b2012bb0d8822ecdd23fe037134b37db0278954b"},"properties":{"dependency":{"package":"tracing-subscriber","version":"0.3.18","advisory":"RUSTSEC-2025-0055","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"0.3.20","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78e2e4614e5e25ec08b93e96a9853675685b49ba0c74c010024666746e476497"},"properties":{"dependency":{"package":"pytest","version":"8.3.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"severity":"medium","fixedVersion":"9.0.3","relation":"direct","declaredRange":"8.3.5","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":"a70f7ae4d5da61b570ef274f18387306a414c36863cf475e6e57698efcd890ba"},"properties":{"dependency":{"package":"@vitest/mocker","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.1.11","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac87d931414ea3b8b888087ac5168d1b065acb348de3a03f7b60e39fb47ffd1b"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.9.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.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":"776f6ba404e26174e70628323a81e257404d1fd7d7c1fc2c92f8d9db5d031607"},"properties":{"dependency":{"package":"esbuild","version":"0.18.20","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.25.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":"34eba11c50cc2394635e97d1e9b704c951541571189926cc9dfe955c51b71b44"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.25.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":"8b83192e4c6ff552f640d3bf5a8a19f19c748b5e31efa3eddb1c2eaceb4d1af2"},"properties":{"dependency":{"package":"srvx","version":"0.10.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.11.13","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":"fd9c08ce4aab760616f2dc6bffd031af73c09992599ea250682480fa1a9f95f8"},"properties":{"dependency":{"package":"uuid","version":"12.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"12.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":"9472c4d80080080a7197acec75499068b860a617e48e318d7d3e1fb2c19386ca"},"properties":{"dependency":{"package":"yaml","version":"2.8.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.8.3","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41da8266ad99aba42e1a15b49148dc4815b8218f5e7ee64f913ffed9f8b104f2"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"1.19.15","relation":"direct","declaredRange":"^1.14.1","reachability":{"kind":"test-or-tooling","file":"rivetkit-typescript/packages/rivetkit/package.json"}}}},{"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":"1c98218c53b66c56892158d62ebcae19aa07e801c5aaf0163dc1041e87914931"},"properties":{"dependency":{"package":"@hono/node-server","version":"2.0.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.1.6","relation":"separate-copy","declaredRange":"^1.14.1","reachability":{"kind":"test-or-tooling","file":"rivetkit-typescript/packages/rivetkit/package.json"}}}},{"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":"f43eebbf4b1909e1cd9ece994c448a756df752e947ddf6c891f9e59a514bcfe9"},"properties":{"dependency":{"package":"@opentelemetry/core","version":"2.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.8.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d83ca1e17a0d130198c0fe5e01d3922b7181ba5649ee82d5e37b082140cef56"},"properties":{"dependency":{"package":"@vitest/mocker","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.1.11","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":"d34cccc87559ec39fca7abaac00bbe6e80601b6e0693f522d865a03907dc8e22"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.1.11","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":"b7bda289298f8c7b577c3df21f51a6fc17f92b7e23b2a76b5f7c4731a8327d8c"},"properties":{"dependency":{"package":"ajv","version":"8.12.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"8.18.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92da29f94e263abea0ade968703748a9c42d1739d2b2b4fd0b3d8bd698b99428"},"properties":{"dependency":{"package":"ajv","version":"8.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"8.18.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"852cb48ed07a12d257026dd9fe5a1514ce501a80feb576088d202942792db6fb"},"properties":{"dependency":{"package":"ajv","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"8.18.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16bc49aac72eafef4ac9a880a9755121d0367a6bdf3e48689c49c4d9d8c09a58"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.9.19","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8b544d1d3ccfbbad81802adf1e0c471498231ec36815984b65b48723467c465"},"properties":{"dependency":{"package":"esbuild","version":"0.18.20","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.25.0","relation":"separate-copy","declaredRange":"^0.19.12","reachability":{"kind":"test-or-tooling","file":"engine/sdks/typescript/api-full/package.json"}}}},{"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":"8fbae7affe33d99a549f4b8a8aa5e5e6d3bf16e68922adf11e518d7f63edd09c"},"properties":{"dependency":{"package":"esbuild","version":"0.19.12","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.25.0","relation":"direct","declaredRange":"^0.19.12","reachability":{"kind":"test-or-tooling","file":"engine/sdks/typescript/api-full/package.json"}}}},{"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":"f8befbd221124a8e5a9f0b84f2de7e4536be88c5dda49d854535c6673f35fc80"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"0.25.0","relation":"separate-copy","declaredRange":"^0.19.12","reachability":{"kind":"test-or-tooling","file":"engine/sdks/typescript/api-full/package.json"}}}},{"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":"03fbcdf09a22d34ca5c914ad9fad017791b0721825e41366b71be3ace7a4642b"},"properties":{"dependency":{"package":"fast-copy","version":"3.0.2","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"3.1.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fb79007bff808f0f9ed82f4d428b3c45193863658dcd9768c0fea9c35128c01"},"properties":{"dependency":{"package":"fflate","version":"0.8.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.8.3","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"073e87cfb01a85fd4101643ff63736a2e135a540f73c55c934a0afd4029045dc"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"direct","declaredRange":"^10.3.10","reachability":{"kind":"production","file":"scripts/publish/src/lib/version.ts","line":21}}}},{"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":"79017ef314aa605ab34ece1ca7aab84ce5480bbbbbe3a9a9cc2f4121e1f854e8"},"properties":{"dependency":{"package":"glob","version":"9.3.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"separate-copy","declaredRange":"^10.3.10","reachability":{"kind":"production","file":"scripts/publish/src/lib/version.ts","line":21}}}},{"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":"a3e57f6170b52b12e25af389ad877f16f10939176bbed4d6a1fc5bb97849abeb"},"properties":{"dependency":{"package":"hono","version":"4.12.25","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[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]"],"severity":"medium","fixedVersion":"4.13.16","relation":"direct","declaredRange":"^4.12.25","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/src/common/actor-websocket.ts","line":1}}}},{"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":"ad41fb3c6e1d06bf8eedbe769c511d5c1f0cdb4c438a3d8b950ed327c0d4bbb7"},"properties":{"dependency":{"package":"hono","version":"4.12.33","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]","[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]"],"severity":"medium","fixedVersion":"4.13.16","relation":"direct","declaredRange":"^4.7.0","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/src/common/actor-websocket.ts","line":1}}}},{"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":"d10c79b7ba192f2bf3e9d396706548fd35619089ac0c9053c2f32644873e24c7"},"properties":{"dependency":{"package":"ip-address","version":"10.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"10.5.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":"9f9969cc1dcef0e64fdd2efb47b4f5e837c1cd854c95ddd0d8beef9c7c6a680f"},"properties":{"dependency":{"package":"mermaid","version":"11.12.2","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":"medium","fixedVersion":"11.16.1","relation":"direct","declaredRange":"^11.12.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":"c3bac0b956cc7625db5ffaa04443fc36030c2af44043a6f2dfd365abaf694f40"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f0e25f5043cf62eebe19b8bc6c5720079d3f23e4fd644df5f6587f0c96e9743"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fa903053a3f312606416859cb67a9d184205be1a801337492ae8f642ebf9203"},"properties":{"dependency":{"package":"qs","version":"6.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"6.16.0","relation":"direct","declaredRange":"^6.14.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7814cce334b52f37373b221d1e431faf0f063fcfa3515d254ad139e207e66dae"},"properties":{"dependency":{"package":"srvx","version":"0.10.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.11.13","relation":"direct","declaredRange":"^0.10.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5195098faf77c255578453173c9756e85fb14347a8c3b35399684e48e4e14942"},"properties":{"dependency":{"package":"turbo","version":"2.5.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.9.14","relation":"direct","declaredRange":"^2.5.6","reachability":{"kind":"test-or-tooling","file":"package.json"}}}},{"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":"3528f74715fc84573f6b06f7ef3594f9d7c935c2ed1b180b97da1e8ad6753089"},"properties":{"dependency":{"package":"uuid","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"11.1.1","relation":"separate-copy","declaredRange":"^12.0.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a59776600ca658e263254d6a4cc8d9fda50a5e5e6510982169e55324e27039f2"},"properties":{"dependency":{"package":"uuid","version":"12.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"12.0.1","relation":"direct","declaredRange":"^12.0.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9b2ed8c1042f8583e27275894b739504a54efa40a0a8d3537392eb17daed86a"},"properties":{"dependency":{"package":"vitest","version":"4.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"4.1.11","relation":"direct","declaredRange":"^4.0.15","reachability":{"kind":"production","file":"rivetkit-typescript/packages/rivetkit/src/test/mod.ts","line":1}}}},{"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":"880c5a9e3754ff2f8b6ebe629520afecbaa8208a75ab43985dc95bf538bfa60c"},"properties":{"dependency":{"package":"xxhash-rust","version":"0.8.15","advisory":"[GHSA redacted]","severity":"low","fixedVersion":"0.8.16","relation":"direct","declaredRange":"=0.8.15","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":"0bbc8771e8b28b85133437c6d6b29fae8e3439f13f3358313e2ef309563fe69d"},"properties":{"dependency":{"package":"@babel/core","version":"7.28.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"7.29.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c17eea2a205e8f19c0265e08cb6d7aeefeb38b21fc2dee79f4e67c62a5b4be5"},"properties":{"dependency":{"package":"@ai-sdk/provider-utils","version":"1.0.20","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"3.0.28","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":"13bb03b1d3c37b8a60fe73b489a60d01c248262fa6c9659ee52f08de9576ee85"},"properties":{"dependency":{"package":"@ai-sdk/provider-utils","version":"2.2.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"3.0.28","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":"8d158fbe66b3a4e344e737b8b44da0eefa99072b63e5c173ba05e221e1225472"},"properties":{"dependency":{"package":"@ai-sdk/provider-utils","version":"4.0.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"4.0.33","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":"f392b1419f96aa208ac2115d3c34c2f00540ad0c5381e81423f8727e54319f35"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"7.29.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09f58d52b643b54b06b7b17dbfeed1c873e96f2769e9a342cdd05d5218af901f"},"properties":{"dependency":{"package":"@better-auth/drizzle-adapter","version":"1.6.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"1.7.7","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":"89e2c7193c100d47a06dfa4294abbe429021369ed5b703b402e9e8156e262a31"},"properties":{"dependency":{"package":"@better-auth/kysely-adapter","version":"1.6.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"1.7.0","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":"729fde98da2093179cfe3ba158e8b07d4443192089dcad1a1a02a6e5d8452e98"},"properties":{"dependency":{"package":"ai","version":"4.3.19","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"5.0.52","relation":"direct","declaredRange":"^4.0.38","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":"3f54d1f4607fdaea22194262dabcf05db6136d2d813d8619ac129c6b6f33edda"},"properties":{"dependency":{"package":"esbuild","version":"0.27.3","advisory":"[GHSA redacted]","severity":"low","fixedVersion":"0.28.1","relation":"separate-copy","declaredRange":"^0.19.12","reachability":{"kind":"test-or-tooling","file":"engine/sdks/typescript/api-full/package.json"}}}},{"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":"432ff96b99be51f222129d719522583eee1238a6387f8e848868f9c7452f2139"},"properties":{"dependency":{"package":"fast-xml-parser","version":"5.10.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"5.12.0","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":"b7198a068b97a1af1f65e3196cdf11565ec276006632a836614e182488e4d847"},"properties":{"dependency":{"package":"katex","version":"0.16.27","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"0.18.2","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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","severity":"info","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":"52a235ef83472fecd5e0b04d1f9730bcb7a3aad92485ae6015834790e66eb4f4"}},{"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":"7219ac1b32e9ae936bc07d51f091f84b7e1bc2b87d6e63636c039908680160a7"}},{"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":"364a39c79a29881931bb0eb9d81263203e6442a4e3f25536841b1396072591df"}},{"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":"7a1acd13a493cf8117fab89db94d52107c734373b514af4a78e0f41be473bd5d"}},{"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":"45f89862b5adf0711c5b5f7c32ae79b49b4a50052b613f4783474691d926819a"}},{"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":"7362f2ab5741b04be082cc0ae3659fa53f673437bdf5e24df65fd7e6c4989a99"}},{"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":"07a19ced417c14054d438c31c63667f2f406d025a7c63c6b112f83350eb4c2f6"}},{"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":"b98f158146fe197d06e8395daf284932f505e2598cb4bc81630eb975b92b138e"}},{"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":"f5a317f06d420cbcd8d19aefc8eb0d6a85abbfdf6ba7ae0a0fd0066adcb9679e"}},{"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":"0e6c5b10d20ef9caa1b677ac8985478588fac42f1c8f95840189b75ae2f899c8"}},{"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":"f4b3c249144e272f496e654ee9d8a8f8946c03b10fa984771d7a3cf64638f3ee"}},{"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":"3a343085d0fd5cb57c19903d4bd3fbb8d4210fb195fa95152c9a5f125dda0b8f"},"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":"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":"e94bc6334b4aebb983fbf5430eac25f54927c73939df99f932623becebb150b6"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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"}}]},{"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":"150b0b13f16ceae95a0db815f9573f212bab1ac73b70d3fde9f3c604265e0316"},"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":"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":"30d9016523b4bf8c2323f65b5ae12d31b3aaea288200c56555be7c67d5fc8148"}},{"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":"42717d08cd7dd990093cf9aeb59d1ba7d7fb5d2536b279dbb2a858cae273f168"},"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":"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":"efdfc618354a007983ff484346d0ec6d3695128e0972037ddd0231d5414f9e85"},"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":"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":"5b39384347e0d3167152667ee327282ef3179ea568d32d62266eaee81280da21"},"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":"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":"d7e6e1d051b5adb0ee6b19aeef63390dd003542ef9c6325a5b8a0f20d0da310b"}},{"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":"82059c0cf2a6a11371322c825ced412be4dae6e5293f075952d71f7853c81fdb"}},{"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":"b23d0d7802fb06aaf062f56b81019bbf816a127fb3e2062b0a294273e5ea1d3a"},"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":"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":"3090c40a50b7d2a0232a554ee59aad148e9807852adb462c210a93b5811b987c"},"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":"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":"86a8fde70e228071393e0fd075f05a6d00e4a3636d8f7ec29b1dd46f7b963c3b"}},{"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":"2a40b63e17e97b7081c9c77c645beccea1a841694cbfaba37b12df3697133771"},"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":"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":"fe8964aa3b99984e3f36030a4bbcf5b82cfa732c9dccabbe5ebc4f77daae98be"},"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":"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":"bb85d75fd3b1ebd6542aacd49613adc1892a5a1449fac0d237e4b00004fcefb9"}},{"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":"911c6aff681f75b9d5447d330c0946e1d3bce45c8c7a6bebb86bd7124da7fae0"}},{"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":"39e0ce93bb3a44f0d1e748ef1d3c1f8ef4d98447c8f8d6637b2512b2751a0e93"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a1d4587e02d2d98af8baf7d30e21c0111d89452a5eb2fb79421e904d500f69b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dfd0aee0fc2ec341d97736d2a2791e2981112bec857d2c61415e3eef17d1d7dc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94cfb75450c4cd621a113b86a28b6e7e82ace36bbb498408af24ba31bb7732a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"151dcb011861253c136ac656b60ba7061d11fca1fa35bfbef39cdf7159e67100"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9aff15e28ebb5fceb49f1da2f0dd2b5ca2ea47bb4846be49ec21a4ba719be3de"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67226f8fe03e81357a9315c888d620a968444dcb3a49a1e2fbfb4aa8103fafa2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ccb32c58e6810952494d8eb1b11384ff4b56e74c8ffa4a4e16bf85ff1749118"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63dfe2d5a6c077b09015a521b2934d067cf34f0edfa9dbd0194f4caf540c520f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"653e16e551378c4a2ffc1f59e93991ae04a92bd25ad1a67ad5ed921d043736ea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67c54bac6328d14943df370e7d6796c514bed60dc4cd10c0b91301106bd56e1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e398b3ae65db30568b94b29928601d0f1a4d1fb7c1a864cc8c71e390b2823aed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"b0297bfb0c8821d6ac337143e15c85c82c9611230e387e5cb99aaa76cfb0d2db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e2b9bd720fedb5933820058b540c7223b4e3ea72c7d9b4b8f8815afa61b285a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"7beb1ae578e20f4e96c9dcdddc448f516323ebd03d7aa496dd6c1b66d848f470"}},{"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":"29aa7123ddfae093ecdf4f7854d815bad9b7c29628a78c35e7413bd0c5289166"}},{"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":"10795cdccff536762d9bf43c42cd6330f7c97163b08b4ad544314c2abb02c34a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48d368ce39e58f80d427fa8656cc6752f4b01a9d75f7fd99ae078dfea2e83ad1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"e3dfab58e22428f5c6143a2d2f744628bae61c105bac63aa2e53ab3bebf7a74d"}},{"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":"295dbb8a60f27536b5daebf02e86cff125fa380e808ea02bb2a836860da58c55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"c0a0612eab050d322f7343867e2cb09abe5a3c934b2e75fe5ecdafea7bc61771"},"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":"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":"212c385d4260d14a9c10a15efbb10e084c6b338b815422959ac6a43f97d24c61"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2e0268a64c9a749c57435a2ccc532eebf960a56a69701b065ac0dd0ede84858"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"0c3694dd2a943d57d2c523168d5f648e89fa104b584cbb2a985f07b4d8663012"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6702c3fb4520969446a2eb6b3cc24f1215e3b87215e76c0e8b5b966c4600f57"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5cb94881184c1e6bd3b8c26a634e8650460aec51bf6021af9ef34e3d76d2298"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71f3bcb9a5855a2c94d924842b7311b10c7446aaa768652f53d6707572053523"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"a1f8ebcae2d296fcb31ebfcbbf1ca1c3b74a58b4b69ed554d4bde33d890a4998"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a45c17a84a6b7174b05f5a21fb3e4ee2acfad76cac51ec0ec7071699236d6e79"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9c7fa51fc47eee8219678ace9b54e09fe8c996023484bbcc1b7bbc37197eb00"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c29543711d9874d9a60ba93ccca5a6732235c12d586573be6a29dd36360cf002"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23d5129ad25c4710f43c7fa94c8bf95bc03fec4aed006184892fc84dfa90bcbc"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f2d3d340c5df47d07922b609de0f3659b217f0a56ad8d0998e8135c280a65ac"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb2fcc2324cf346a9fcee43a47deb42b7f825f7b6bdf0092628f7f7994e13147"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abebb2daffdae9111823b94e3a984ce1423c828f5b091446502dba58be3d4fcc"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a63f1220c03ba4074e3fa05ec5b3ae96fbb2740ef65c23fe5df3a8fa50306507"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07ab76da13fbcb982631ab3286f026013993d54c63ea69c6368148b937f97498"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: wasm-runtime.ts \u2192 context.rs, lib.rs, napi-runtime.ts: \u0060rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts\u0060 changes together with 3 other files \u2014 \u0060rivetkit-rust/packages/rivetkit-core/src/actor/context.rs\u0060, \u0060rivetkit-rust/packages/rivetkit-core/src/lib.rs\u0060, \u0060rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e294ab70d487b947c9a8e06962b4ad93c4e283bb5679735031475b6733dd3c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: actor-http-client.ts \u2194 actor-websocket-client.ts: \u0060rivetkit-typescript/packages/rivetkit/src/engine-client/actor-http-client.ts\u0060 and \u0060rivetkit-typescript/packages/rivetkit/src/engine-client/actor-websocket-client.ts\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 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 \u00606a52d2ee\u0060 fix(gateway): support skip ready wait routing; \u00604df4d5ae\u0060 chore(rivetkit): doc skip ready wait; \u0060fc57d3c1\u0060 feat(rivetkit): support gateway bypass client requests \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/actor-http-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab02726894cc91ba5f01a39e3a9a4c9d2f52b017a8a4cd85f167af8bcadefb0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 napi-runtime.ts: \u0060rivetkit-rust/packages/rivetkit-core/src/lib.rs\u0060 and \u0060rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts\u0060 change together 50% of the time (10 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) 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 \u0060982eb970\u0060 feat(rivetkit): add tracing for workflow runs and steps; \u0060b965bf6d\u0060 feat(rivetkit): trace actor to actor calls; \u0060f5827354\u0060 feat(rivetkit-core): trace queue sends and receives \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4302fdac112f00383997190f2f566b399e1b42b8fce6395ca60c213dd8ef621"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2e4bf61ff627d89e7aacd887d53fa1d74cd39c24ede16ef93192e6e03b0421f"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af4ff3ef260a9972bbba143d638f75934764a0b661cb8fbcb01477c04afb1a31"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a914dd23ce54723e886885da52f34a0439a05c77754986d6d6a6745922f4a68c"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0c8bc6e51535ed478eae6a7a5c606a4581dce7be705a4e2a49bb184b8b178ee"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e734737cee66c1eedcddee5fe1da21769046a9daf74249e4bb652afa393bf43"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0134b7c189153d8faf2b50e66c91ca1a475bea612c9a4f7ecab015664ac09eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 20: rivetkit-typescript/packages/rivetkit-napi/package.json declares Node.js 20 as this project\u0027s engines.node, and Node.js 20, support ended 2026-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-04-30 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":"rivetkit-typescript/packages/rivetkit-napi/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2fac88ecce9222fb97ec1899fb451aa389ee46ee33b9240eab4a62105362ec"}},{"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":"rivetkit-rust/packages/rivetkit-core/src/inspector_bundle/wasm-custom-tab-unavailable.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb19effef3c98c0ab66a74a44a137b48d84d8ac44305a45c93701e764fb9a777"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.input-wrapper textarea\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/experimental-durable-streams-ai-agent/frontend/App.css"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac68b5da03d84b3ef063ba5b760ba0701f3cb5c0033da06a3d78e35643d742af"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060element.animate()\u0060 moves (\u0060Web Animations API keyframes\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":"rivetkit-typescript/packages/devtools/src/hooks/useDraggable.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e912202e93dc5af4adef250c7377df1da30d5dc3ddf9bdab595f262ffae02fa7"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060validate\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":"engine/packages/config/src/config/epoxy.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2461321287b261dacee506ad3fddf8569a5ce24758fde333807bc30d45710604"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060observe_applied\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":"engine/packages/depot-client/src/filesystem/backlog.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7701265756505264c905f1f2de35f731c7f7ce3b5c6beb6de47c54eb35b9ae01"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060install_status_notifier\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":"engine/packages/depot-log/src/log_shard_machine/runner.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"48732aca7ad432b38691f4d0b5267a4fa91d2fdd2a4eb2262f2e0f0123c638b3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_alarm_owner\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":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"356f2afc6e31c7fc0d0ec3e219f77e912dbca05fa061ad97d300ec4ddf672a4a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_tablet_cold_get\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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"433a79125752ef64c0a8e794210fa9bc24f94b695b684f1a43b76670bd53c546"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060impl Discard\u0060 has 3 unfinished methods out of 5 \u2014 a scaffolded type that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df551b34176fa9b7630ef72d102557374511b1ddf994905775b1092d38bb457"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060inc_by\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":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6ee2952a095f73c5cb32b1723196509f5db0c9d9f0eaa026f43a9ad6f3101a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060observe\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":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a899c1b932fc490978ebd104ae62a9a89238e4181acd3519e52b814388f161"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set\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":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"588c98082d96e4ce858d81ae65a6e7b0a81bf3c238d6de386336efc4a983dfc7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_member_repair\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":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"105b1c0f60852783691dc1d1797a8325d23107475deeb89f6e7f45e837134fa3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_recovery_scan\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":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9eb41c519f3497a734a17e26ea80e0ac98b4af96e9abfbb2d096b08f161276"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_status_observation\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":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"37981ab842e23a685391b297a3731e4b81347576c85dd86bfb33a1e6ef30c441"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_idle_visits\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":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"953b0f22061305572e2d29b7ddaeb3125b86438950e0c1a636290742fc9c990b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_retention_check\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":"engine/packages/depot-worker/src/metrics_wasm.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ac352152c26b5d7ac2ac08492a11e19d6b6064f4ed21c57957c54d5aac598a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060unsupported\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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7914bdcadb345b3232c5e318a61ff537806393140616f1341e7933efdc41f85f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060remember_group_name\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":"engine/packages/engine-context/src/context.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad5e27c809803a4164886a53520c72a6e3b8d81a39c73722ddc850c761be087"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060progress\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":"engine/packages/engine/src/depot_command/migrate_from_v2.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba11f041033227085b606757d8280b9350621a8101427cb4baedb4db30a02be"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060print_command_output\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":"engine/packages/engine/src/main.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c5420d7560753a871e47b41112a2c914d0a5106333632cc3375504bc10e656"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060advance_epoch\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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18a8fede48f98be39fe11cb8a34402300a8b31a251c7bd1c39a8b28ee60d529"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060x_shutdown\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":"engine/packages/sqlite-embedded/src/pager_cache.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcaf6cb868c0b93dadae9de502767c7f888de4d6c4c3f66fe8deff2447eb0d6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060x_cachesize\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":"engine/packages/sqlite-embedded/src/pager_cache.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2f9fd033b8d5f3b99ef5d24e93c0f69ebac4df05a114d6f23e80227d745d34"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060replay_read\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":"engine/packages/sqlite-prefetch/src/harness/vfs.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ed7127da0ba542c0f4c95eb400d1e5f1cd1a187d71b1c5fa9dec9e2e7bcf84"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060vfs_get_last_error\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":"engine/packages/sqlite-prefetch/src/harness/vfs.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b35a303ad41978e050394822fd0be5696d99540f7ae8062c4b8d189372330b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060send_response_abort\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":"engine/sdks/rust/envoy-client/src/actor/http.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"167a5cdcd4a4464408613c7284ffb961a21a105aca726bf8857cfcd85296ffd4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060start_connection\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":"engine/sdks/rust/envoy-client/src/connection/wasm.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62b64b4bedf952c99ed3f363e98c2586f05ef82fcaee8a74171b095d15933c6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060sleep_actor\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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9465f6d4ad7439f5dbd80093a5e5f5911ddcf69e838a965761cf7d822c2c7f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060stop_actor\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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2b6056c8cc1d8e591a9b9da61d9fef779ec3de80937cfa6b4ee2a9c73d58dc"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_alarm_with_ack\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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdea6a5aee661d576fadccaf5f6a6df80ad2a01c936b73061736e61f41d46a4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060send_hibernatable_ws_message_ack\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":"engine/sdks/rust/envoy-client/src/handle.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3917450562cb7f16dbb5e0d751f8baf69ea7c401bbeb30dbff7fe368e9c19f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060impl WebSocketSender\u0060 has 2 unfinished methods out of 4 \u2014 a scaffolded type that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/websocket.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cace00014c5c4137f281c580955ecd13217263bb6b95e38805a9ec82e0275a54"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060send\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":"engine/sdks/rust/envoy-client/src/websocket.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85d153a8d3ecbaa231926441a404fea72a26ac3c02a141493d7ac8ae309383e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060close\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":"engine/sdks/rust/envoy-client/src/websocket.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e874b8fe9bf6a9303b6d097a106d83ae1d0eac59a5675b274db112b511b2ed"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_fingerprint_catalog\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4a5c46432a6ab6538b5277bbd6e466a8f2fe564f7806a2e54b233c8522475f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060log_dispatch_command_handled\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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"99760c631f81839ab7907d45ad1a116624a75094d015d139c2abd0dabe42f82f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060log_lifecycle_command_received\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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb8106c03a626a0acb40cd9a4c9778a6cdb58ac591df1f37cad2d2340be51ea"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060log_closed_channel\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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c5ded9015c52ff37efbc56cf8359536f21b870b9e6872c545ca45f8f24bc01"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060warn_dropped_event\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":"rivetkit-rust/packages/rivetkit/src/event.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df7d3fd07513fd0b9f1743e7ae08dc66ae8dfc8d0e2381b0f37bb3794123a27"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060dispatch_event\u0060 does real work, but one of its branches is \u0060anyhow!\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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcb0fd6f6c3bc7e833458676bb9a709b80a68cb7431a37de4be52f0e5e29b66"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060dispatch_event\u0060 does real work, but one of its branches is \u0060anyhow!\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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756a97942cee725d7141716b5450213061c960d8194f1241792cb135c76479c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060dispatch_event\u0060 does real work, but one of its branches is \u0060anyhow!\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":"rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7261310ed52b2446f556770adf4e790a896960a576289a6a41509e177d0b3b9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/durable-streams/content/docs/index.mdx names RivetKit 2, but the manifest declares \u0060rivetkit\u0060 ^3.1.1. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/durable-streams/content/docs/index.mdx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a7c4892b4fbc7685b8b61dfc9f7e23c8a7540c56ffa03e62b5ef7eb041feed"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 46/48 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060rivetkit-typescript/packages/cli\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rivetkit-typescript/packages/rivetkit/src/utils/node.ts\u0060 reports through \u0060console.*\u0060 at line 85 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/node.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e7dac644a631d4d0fd214d9c93676c0a668ac0d9e46fdeb8f1bb7239c1681f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rivetkit-typescript/packages/rivetkit/src/common/inline-websocket-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 165 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/inline-websocket-adapter.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade0b1338fbcd67c22af755a48ebfcf39e8e21c5b28b0bf4681f7b0af6ddc6ec"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060rivetkit-typescript/packages/workflow-engine/src/context.ts\u0060 reports through \u0060console.*\u0060 at line 2773 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27e059b98ad4d50eba03909eacc1d154a66f2b4abd116c8339eb061a231aea2"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.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":"package.json"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 0 versioned entries, against a bar of 3. Counted as either the distinct \u0060x.y.z\u0060 versions it names (a link\u0027s target is not counted) or its version-shaped section headings (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/auth.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"964a31c07bf3cc6bee6b813f8d8b77a1e23ea715a18dfbc9545109ca88031661"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/auth.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21b110a1c64e8476f6e3071a421399146091f2d238ac19d753e40ceebc2f686"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/auth.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f401e3f7cb6b5a868c3d8cad74a773207ab40cc7818f67cdfa92992d13d74c28"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/cloud.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a674d337dbe7cded888956bde8b731d17269687379264ba9b8bf89eb2069931"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/backends/production/external_http.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb82922792fd2cf19c5e81a8008631fa677688604cea36fbf453d2867a11dde"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/backends/production/http.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a61583ed9f49fa7c6d886d921c0e72a0f697830736100ae6c6589c3d321d959"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/backends/production/http.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b3c8746b6dff94df1ea98384561d9a4ad87c940a77cb7f6db459679ca879d5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/remote_manager.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"81200612f03c3c6b5ad4a663081b57d89a8cc01bfc3433e21633940d0988328f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060LoadHook\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/sql-loader/src/hook.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"119ab0f945b7661c0c07410d3f73de21e079eca67961bf167667b6fdb510ff49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 10 sibling directories (14 clone groups): 14 duplicated blocks under rivetkit-typescript/packages/rivetkit/src/ have copies in at least two of the sibling directories actor, client, common, db, engine-api, engine-client (\u002B4 more sibling(s) not listed) \u2014 7 of them are reported below, and 7 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 14 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 14 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 14 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f759dd4ac2f1c69a55bcb18be6678425d16269a6586e56328d413005615e796c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (12 clone groups): 12 duplicated blocks under rivetkit-typescript/packages/ have copies in at least two of the sibling directories cli, effect, engine-cli, rivetkit, traces, workflow-engine \u2014 8 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 12 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 12 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 12 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/scripts/compile-bare.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"930241821af75d87181c1fc7956cba4ea039f2d2875fa26fbcdd7142df27ebbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (195 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v1.ts:4 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v2.ts:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 1125 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v1.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb98be095dfa31ea0bfd50e61438be57e5b433bcf03902eef90b1f291176167d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (110 matched lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/src/context.ts:2153 \u00B7 rivetkit-typescript/packages/workflow-engine/src/context.ts:2368 \u2014 the two spans are one implementation copied and then locally edited \u2014 541 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfd792ada872c743600df37bf73f4a1e4571eff82f4fda77ce307aa6bfcc1d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (108 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts:484 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:381 \u2014 the two spans are one implementation copied and then locally edited \u2014 412 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e87e2d4ce8f6d645df7cf86f42ed2eeb2be7d0ca487990d490a90a8430b8b3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (106 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v2.ts:93 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts:498 \u2014 the two spans are one implementation copied and then locally edited \u2014 528 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v2.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a2852b2e6aca0fa19d2128d149fc9a0e1d7e992929a137e4e86c0ad656133b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (70 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts:96 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v4.ts:98 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"766fbae9993e742664d98b164e2d8d15bcdfcd6f254b97d939414960c83ebd3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:2080 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:2180 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"98530eb7bfdfe3346a0036a059fe550a8e87ea42b1aee40611c090312366f8fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (60 identical lines \u00D7 2 files): rivetkit-typescript/packages/traces/scripts/compile-bare.ts:12 \u00B7 rivetkit-typescript/packages/workflow-engine/scripts/compile-bare.ts:15 \u2014 these 2 files are line-for-line copies of one another \u2014 60 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/scripts/compile-bare.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba4457b2747c50f55850ab52e39423cadb6563a02c1fda27af68e65c537757d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (54 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:5724 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts:898 \u2014 the two spans are one implementation copied and then locally edited \u2014 245 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":5724}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cb73f6b3bcd66d069bd7361f27d297ba40080275984f90645ed4ccebed1f6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts:239 \u00B7 rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts:821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8b7367251971106cb2948c2c7bb7ef9a85e4b6de495a95013507f1d25e02ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:293 \u00B7 rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:346 \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":"rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"47089e19e5ccaef8e8b1ab71cf30c80e9b97397a16897ba837af7c584c4351da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts:1001 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:960 \u2014 the two spans are one implementation copied and then locally edited \u2014 281 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"00823b94e9b2d0f02eace720aeac0d093eae0aae8a5a6dabc079e3b8a16c27f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts:216 \u00B7 rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts:97 \u2014 the two spans are one implementation copied and then locally edited \u2014 236 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dc62b4fe0fe7bed1eb561a2b238f15e33e9c913a250b4f55b402bcbc83405b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/workflow/context.ts:260 \u00B7 rivetkit-typescript/packages/rivetkit/src/workflow/mod.ts:109 \u2014 the two spans are one implementation copied and then locally edited \u2014 108 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca00b8b2bd5881dccf9f810ec81fb5fe6f78c14ac4eaef467c27230983177b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): rivetkit-typescript/packages/cli/index.js:6 \u00B7 rivetkit-typescript/packages/engine-cli/index.js:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 216 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/cli/index.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc210482a4d558ba9cf7356664e792a64d8eaf11a6242b973296206483f7cf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts:325 \u00B7 rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts:434 \u2014 the two spans are one implementation copied and then locally edited \u2014 331 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1192330f5f365cebfbbc92bd901e61418ead96c63f1578b97fed87f00716b382"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts:179 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v4.ts:181 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8347cd132d1c0a6af74f3c9693995086b9842b31ef69d4864374144e5ae1e95a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 3 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts:127 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts:184 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts:231 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1247800ceae0b2d62c7fff81909ae6a9e6f563fb85e91ed9ce191a144adf407a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/scripts/check-annotated-skips.ts:5 \u00B7 rivetkit-typescript/packages/rivetkit/scripts/check-wait-for-comments.ts:5 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/check-annotated-skips.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d1e1135cd603dd81da11b7c6ef277f6a4126c89d72b6377fa407200c737577"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/workflow/context.ts:145 \u00B7 rivetkit-typescript/packages/rivetkit/src/workflow/context.ts:180 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"62112a16351119afe24269199a28b20021f20b1304bd9d345b0e8c15d73fe630"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts:5 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v4.ts:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f5d31945b2f063dd6e88a4ec3143113dca1239d43d2d633f9f3498625faaaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts:52 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v4.ts:54 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a096f4aa32b06b30480ff3332ed37d1f4528a7a813dbe2919e7eec8e90aa1ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/workflow/context.ts:697 \u00B7 rivetkit-typescript/packages/rivetkit/src/workflow/context.ts:771 \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":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"325f52b05d242ae4e6e2a643bdffe3445eb80e99e38e2b09610c644fa41eaa92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts:445 \u00B7 rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts:806 \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":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b473ac367589f23d39eecb4b56bbd0c86e69cf251604ab4d5bf5ddd328eeb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts:234 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v4.ts:236 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"264674e59df830fa62901be94a90b977f355d560eda73ca48f7138b1aa61da7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 24 locations): rivetkit-typescript/packages/effect/src/RivetError.ts:11 \u00B7 rivetkit-typescript/packages/effect/src/RivetError.ts:46 \u00B7 rivetkit-typescript/packages/effect/src/RivetError.ts:81 \u00B7 rivetkit-typescript/packages/effect/src/RivetError.ts:116 \u00B7 \u002B20 more site(s) not listed \u2014 all 24 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/RivetError.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f224cb998bb5ac18f905fbc1541dea71a2c40fff7680458559d17df742116d73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (28 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts:976 \u00B7 rivetkit-typescript/packages/rivetkit/src/client/utils.ts:196 \u2014 the two spans are one implementation copied and then locally edited \u2014 133 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c62efef201d263da4411bb0dfe9784517f08e0a9972ec16ea00721403c37f82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts:309 \u00B7 rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts:275 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3979f7878774d0edfc31685b18f36969a64bbe03494d15941f520dee3126f98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:565 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:603 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb443a0370519f74d1f3c0f9a15753788c64792309eeb5182c94d9d7f13b0294"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:1782 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:1826 \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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa1104eaa5431e1ba05230c11d82e933867072a5507052c29db44004d867e01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:4985 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:5082 \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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4985}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e7acbbecc534c47996599ed3bf21b7eb38ff67d8721c83a8fd7953bd8a6712"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/scripts/actor-config-schema-gen.ts:6 \u00B7 rivetkit-typescript/packages/rivetkit/scripts/registry-config-schema-gen.ts:6 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/actor-config-schema-gen.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a845b62171e9693c80f9aaaad8d90e70ad208daaa13297725f5950fb3658ab65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:891 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:176 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"850ec8457eba985dc76823d441b7b8a5f53c055aac18765beb2764ffcde15a3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3 locations): integrations/workflow-world/src/actors/workflow-run.ts:896 \u00B7 integrations/workflow-world/src/actors/workflow-run.ts:929 \u00B7 integrations/workflow-world/src/actors/workflow-run.ts:962 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cefbc302ed3bad04b3e25fb9d3ed1ee0604bfe8ef906d74bd246f91231c01cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/utils.ts:230 \u00B7 rivetkit-typescript/packages/workflow-engine/src/utils.ts:16 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f7e7a1aee590b0c8cb29f25b7663329a5038cdc549561f9330618548c7530a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): rivetkit-typescript/packages/effect/src/State.ts:291 \u00B7 rivetkit-typescript/packages/effect/src/State.ts:395 \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":"rivetkit-typescript/packages/effect/src/State.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dea077246127826c43ff2677bf59305f7fb3215b9c1fbac8657295809bbdb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:43 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:762 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b33c76f537cf0f48fe8a3fc9b1a1173d2b805ea2adbce95aa8094994d080a0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts:443 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts:784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9b446d00217cc89a9d764ae1be349e8b6282b01617f512d8cc30bac1329233"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4 locations): rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:209 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:251 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:361 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:415 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3214b59fd6dd394ddc3e2ecd2af0d975e3da1b580bb558c3a06e32d91c95df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:5044 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:5102 \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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":5044}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17c704ebce2bd974b4f612cc87a5c0aaa8d6297ddd23067f3142eb13f4c3858"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): rivetkit-typescript/packages/rivetkit/src/workflow/inspector.ts:131 \u00B7 rivetkit-typescript/packages/workflow-engine/schemas/serde.ts:247 \u00B7 rivetkit-typescript/packages/workflow-engine/schemas/serde.ts:343 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/inspector.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fba3d57994124b8bdf7d3240b48c7d609e9e8851a670ad48696b298cc8c36f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/src/index.ts:1006 \u00B7 rivetkit-typescript/packages/workflow-engine/src/index.ts:1120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0ca1d0119902e669fff518878670132a859b714bc5b390c174a77f7b62eabc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/index.ts:587 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/index.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f9e8d32e97a07bca3b2bb1987afb23f1a8f0fa1de0b1a976ab1fcb477e7630"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:853 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:903 \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":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8f8ccb1393a7d2015b90b74950b5a42075860791f4da72937e1fe37e48a868"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 11 locations): rivetkit-typescript/packages/effect/src/RivetError.ts:98 \u00B7 rivetkit-typescript/packages/effect/src/RivetError.ts:209 \u00B7 rivetkit-typescript/packages/effect/src/RivetError.ts:279 \u00B7 rivetkit-typescript/packages/effect/src/RivetError.ts:489 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/RivetError.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5694f1de0ed2f05d7ed304a409f12d744f4069cb4d22e24dc477369c41763a39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:475 \u00B7 rivetkit-typescript/packages/workflow-engine/src/driver.ts:16 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca8fc375ec00a0c5136867d6676b0039f7c06324cda0f1a6a25f0a3693a7ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:2049 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/definition.ts:74 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/definition.ts:113 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/definition.ts:180 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is a DECLARATION HEADER \u2014 the name, parameter list with its constraints and defaults, and base-type clause of a declaration \u2014 rather than statements inside a body. A header cannot be lifted into a helper: there is no expression position for a call to stand in, and the copies are frequently required to match, because one declaration passes its parameters straight through to the other. So the move is not extraction. Give the repeated pieces names \u2014 factor a long constraint or base-type expression into one named type both declarations refer to \u2014 and where the headers must stay identical, derive one from the other (a shared base declaration, or a single alias that spells the parameter set once) so that changing it once changes both. Where the language offers neither, treat the two as a pair that must be edited together: they drift apart the first time only one of them is changed, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eda08a16ec3b3f56ec7febcab2a053a52dfe67c1a08522501b5bb4a44e0a121"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/client/client.ts:291 \u00B7 rivetkit-typescript/packages/rivetkit/src/client/client.ts:331 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/client.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"045ab43f22708ece7a0d9eb47790ca5b3658b0c7ba3b7e965ace045e2bb12390"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts:172 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts:198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ab96186804dc0b665cdfd2937e6318dada5ae52b8c0ceff725fab8bc1af5c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/workflow/context.ts:343 \u00B7 rivetkit-typescript/packages/rivetkit/src/workflow/context.ts:506 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fb1858dacf9dfc1fab9afcb06d5cc76965627b34dd95bf22c3cfb1d6c11a3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts:91 \u00B7 rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts:107 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"46606cc17081e095814c5f269b1ea72334b906b64e7dbbc9e13891c1f7ebff3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): rivetkit-typescript/packages/traces/schemas/versioned.ts:49 \u00B7 rivetkit-typescript/packages/workflow-engine/schemas/versioned.ts:35 \u00B7 rivetkit-typescript/packages/workflow-engine/schemas/versioned.ts:54 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/schemas/versioned.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b32f41a936d3aad38b5d8d76571115ba93c7d6e5981e30005945028f90a26d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): rivetkit-typescript/packages/traces/src/traces.ts:238 \u00B7 rivetkit-typescript/packages/traces/src/traces.ts: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":"rivetkit-typescript/packages/traces/src/traces.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a2980bea5dc6651ebc2042bebf7bc9e3149a00c81614ba781b780d45466995"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rivetkit-typescript/packages/effect/src/RivetError.ts:183 \u00B7 rivetkit-typescript/packages/effect/src/RivetError.ts:847 \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":"rivetkit-typescript/packages/effect/src/RivetError.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5861fcb840fa0e8427232d20be562f84bea78cc2a4de67b235b82724c0bca63a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts:136 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:275 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:309 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc784b961efc3671ca3a0ff2be3886d49e56f79ba8b081a637aa5b2cb698b2ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:50 \u00B7 rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:149 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"da63168c1361c7305660fa13b1074c274b186c540f201130eb87f019ca08e87d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/index.ts:265 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/index.ts:407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1318320abdcba5e9726c55ea46166c397a00d7d4c79e079b270c83402621d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:4876 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:4898 \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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4876}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18bea56c7d239a48c109b6a987544d5e00d82fa83e8643daf1c6e70dd78eb9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:1141 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:1200 \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":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4222d6dbd47be736234d42c8d04a97170be21f015204a878d33fe6f0fae628c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/workflow/inspector.ts:199 \u00B7 rivetkit-typescript/packages/rivetkit/src/workflow/inspector.ts: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":"rivetkit-typescript/packages/rivetkit/src/workflow/inspector.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a75178b6756a0fee8a3a6eb471ac62448387953dd08084ef78fa6d7389969db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): integrations/workflow-world/src/actors/workflow-run.ts:1259 \u00B7 integrations/workflow-world/src/actors/workflow-run.ts:1286 \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":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e448ded37f31c7d66dd70d57a899bc98020bf64ef257e4d4fff061a3e5f648"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 12 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:525 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:558 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:596 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:660 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf0be9d51c6a7af4d47e310cd757e1538ca991305816659b9eb67d4191df9f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts:229 \u00B7 rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts:207 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93e8e44256ea6d55d6245b5e5d94968af36672801b6ea96ae9fc7fa3c57c2b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:4755 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:5074 \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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c1bc6338d5e60a050bf44784f9afa42a51f51c08be05e783edbb7c1ee283a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): rivetkit-typescript/packages/traces/src/read-range.ts:209 \u00B7 rivetkit-typescript/packages/traces/src/traces.ts:938 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"241b6b9a6e8d6f48498b491f43c3c7bcb58195ef33e394f48a33cddd62ec8d42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): integrations/flue-runtime/src/stores/event-stream-store.ts:48 \u00B7 integrations/flue-runtime/src/stores/event-stream-store.ts:97 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/event-stream-store.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa402798d414b757aaf92f2323dd367da565bc1a3153e137a638f3f112bb1521"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:622 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:639 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b633f0cfad1f132f3367db8ebaaf629ebad3b5e8dea9dddf12da8c8c1654012"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:150 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:184 \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":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8174159ba24d63f30e6c82f1c65fcae8f317b3dfc761d9bf2c720018b5825398"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:291 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"046a147ae78bee1ed674d3ec7891211f269756f465649ca7096a2e2ddf00540c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:957 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:200 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed926676ff096586a41e14ec54bedc63e404c3fcab222653075c49f0163233"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/serde.ts:87 \u00B7 rivetkit-typescript/packages/rivetkit/src/serde.ts:129 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/serde.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d960aaf4f39c17bc0feb0262204b7b0d02e6a8addd46d57a2ededc154d578ff8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): rivetkit-typescript/packages/traces/src/read-range.ts:352 \u00B7 rivetkit-typescript/packages/traces/src/traces.ts:429 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac339c72064d96c6a46f94d8d76a32383997bf0525e1381b1aa8e97a50b94f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): integrations/workflow-world/src/actors/workflow-run.ts:1329 \u00B7 integrations/workflow-world/src/actors/workflow-run.ts:1380 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef10760bf8f805752ef6febec5475cf50d89941160c2895c171f0a75ff5e4f80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): rivetkit-typescript/packages/framework-base/src/mod.ts:449 \u00B7 rivetkit-typescript/packages/framework-base/src/mod.ts:471 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/framework-base/src/mod.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"508224561ee70b8d0fddf5a8b70a9a47e864d7eaed9e690ae4e583688244df07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts:151 \u00B7 rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts:419 \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":"rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d727fdc9fb79daa9f8602bbf4b224f867805dd765ee9db635df52c56cdd81c03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/schemas/serde.ts:373 \u00B7 rivetkit-typescript/packages/workflow-engine/schemas/serde.ts:388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/schemas/serde.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22a4d3323d737594ecd35665557468075af385c90ed838f89a21fceaff74dba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/runtime/index.ts:114 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/index.ts:1181 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/runtime/index.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df7857f571b34e80bf05ae955d5094db411fe32e5993f7ba29e813b8fe01440"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts:111 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:141 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:175 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4ccfcc4d9dc51b037574ae4f0e2e402a7505c9927ddf730e022b7a2a77e5f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:110 \u00B7 rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:131 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a4153596efa72cc53aae505a15b2006625f0541b8e5b711f9a50d38c52e37f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:1496 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:3361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d60c38c95df1ec4c2c17515c3361c7a6cd66f5fe0e3f9883252add5f4a6207b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rivetkit-typescript/packages/traces/src/read-range.ts:227 \u00B7 rivetkit-typescript/packages/traces/src/read-range.ts:242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e916b41d6ccb3653e1355ff0f5cdfc56c282201f765601bb6af8c9d00c69ed17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rivetkit-typescript/packages/traces/src/read-range.ts:259 \u00B7 rivetkit-typescript/packages/traces/src/read-range.ts:282 \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":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dde763c3a553e4f42b749398ce1253989fb0a77e73ca970632f50a38eb105e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): rivetkit-typescript/packages/traces/src/read-range.ts:379 \u00B7 rivetkit-typescript/packages/traces/src/traces.ts:443 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"238fb7ee6d7da14bdfad549be00ac003778fa11884c9c11aeb917870483ff83b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): integrations/workflow-world/src/actors/workflow-run.ts:687 \u00B7 integrations/workflow-world/src/actors/workflow-run.ts:715 \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":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"010979fa67fc7d4d7065e9911a1157bd281328035b368ded18045bebdad5865c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): rivetkit-typescript/packages/effect/src/internal/logging.ts:100 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/keys.ts:65 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/logging.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abc6452f01ce2f500042f6d3d54d6e249eb54b27376f5cd8ae778e5d680e144"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts:447 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts:472 \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":"rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc087de819bb015be9749c2c992792693d9148f0359fac2eb82b6107749c5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:2863 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:3156 \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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a95cad73e2bd43a45f3d300c8bd799b8d003dff1ee86237fbe67229d148421"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:1110 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts:1126 \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":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a583031ad67f86e082a12387f985cb45fa9b767ef84d27adfd112677bd37a387"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): integrations/flue-runtime/src/workflow-coordinator.ts:170 \u00B7 integrations/flue-runtime/src/workflow-coordinator.ts:196 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/workflow-coordinator.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65f44dc6dea8ef7745cbc01def72b1566856c2b102a69de7c627ca33933a311"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/schema.ts:166 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/schema.ts:182 \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":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"195807fd21d903f2bef544197da194430817306b251863d541e14e9db4fc8ea3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts:1590 \u00B7 rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts:1602 \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":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0a5f3525ad688d754419762aadc67290479e0f8e43ce566ac7cdb3ba23ad4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:2562 \u00B7 shared/typescript/virtual-websocket/src/virtual-websocket.ts:170 \u00B7 shared/typescript/virtual-websocket/src/virtual-websocket.ts:188 \u2014 the 3 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9c95f72fc918452389201c15e4de7a19d1034ace5c734cf746762f39256b13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): integrations/workflow-world/src/actors/workflow-run.ts:543 \u00B7 integrations/workflow-world/src/actors/workflow-run.ts:1394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfacfb309ddd3689c18e0e7401b10a19115e16da04c2c4f3e2346b99d1dd512d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 11 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:404 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:589 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:658 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:673 \u00B7 \u002B7 more site(s) not listed \u2014 all 11 copies are in the same file, and the CITED SPAN is a DECLARATION HEADER \u2014 the name, parameter list with its constraints and defaults, and base-type clause of a declaration \u2014 rather than statements inside a body. A header cannot be lifted into a helper: there is no expression position for a call to stand in, and the copies are frequently required to match, because one declaration passes its parameters straight through to the other. So the move is not extraction. Give the repeated pieces names \u2014 factor a long constraint or base-type expression into one named type both declarations refer to \u2014 and where the headers must stay identical, derive one from the other (a shared base declaration, or a single alias that spells the parameter set once) so that changing it once changes both. Where the language offers neither, treat the two as a pair that must be edited together: they drift apart the first time only one of them is changed, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a31bf01384ab94cb29938535478ff904ac9e6cdcd30455a71386e0b2e26eae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/client-protocol-zod.ts:30 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/client-protocol-zod.ts:57 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-zod.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4082d01fbea8bd044a612d557f6e24ba1d54b1046619206f4c19972ff62dabc3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts:373 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts:512 \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":"rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d2d67bc22fd78af0c32ae6951c80954517612b1ba9bebab7718563a2e130eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/schemas/versioned.ts:46 \u00B7 rivetkit-typescript/packages/workflow-engine/schemas/versioned.ts:70 \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":"rivetkit-typescript/packages/workflow-engine/schemas/versioned.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dc26e3b8feab81efb7a64979c69a6e15053edbe30d46f21e83c30d5a12f05e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/publish/src/lib/npm.ts:129 \u00B7 scripts/publish/src/lib/npm.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/npm.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ba394d964ad5c0a75051e8d49acb696a31000e6c98bdee475fc53a32100790"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/publish/src/lib/r2.ts:102 \u00B7 scripts/publish/src/lib/r2.ts: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":"scripts/publish/src/lib/r2.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd90a97b5b43a9812676d557529144f717575f97f9b97d839b24098e4adf48c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): scripts/publish/src/lib/version.ts:342 \u00B7 scripts/publish/src/lib/version.ts:460 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/version.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"20db90a0ee33d4bf5be04aaea043975e44a9d02deb3ce87ce68af13aadfc2a47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): integrations/workflow-world/src/actors/workflow-run.ts:670 \u00B7 integrations/workflow-world/src/actors/workflow-run.ts:693 \u00B7 integrations/workflow-world/src/actors/workflow-run.ts:721 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5231804680dc76b721a5eace1e6e40def41ff29c3caf4a502e800005126be89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): rivetkit-rust/packages/rivetkit-core/scripts/stage-inspector-bundle.mjs:20 \u00B7 rivetkit-rust/packages/rivetkit-core/scripts/verify-inspector-bundle.mjs:26 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/scripts/stage-inspector-bundle.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6d87a21df06cc1fab4004f0b71d65e5da1c7e845723eb8301d4b047da5ff48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/config.ts:83 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/config.ts:96 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee5eba97ce28fc09f249824b4c5fe07bd9216eda6533cab50c89c3d558ecaca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/schema.ts:249 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/schema.ts:277 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d3c14c666d7462e435ae36181ff4d3c58d73e84b3b951383d8e7e373c43024"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/client/client.ts:606 \u00B7 rivetkit-typescript/packages/rivetkit/src/client/client.ts:616 \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":"rivetkit-typescript/packages/rivetkit/src/client/client.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe41ae4fd22a81ea0f30637775b8013a35e6557b4c488f5d4e916054ccf11c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts:61 \u00B7 rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:170 \u00B7 rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:197 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac942f24b6a095e96fb66f0f14d0041eebbb95d0b95346084f0dbc068fa8013b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts:281 \u00B7 rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts:372 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0898518553570856238956e87cc605e674b79baa129200d3b4d36b7f81791b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/engine-client/actor-websocket-client.ts:216 \u00B7 rivetkit-typescript/packages/rivetkit/src/engine-client/actor-websocket-client.ts:298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/actor-websocket-client.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9741f1617230e08c7a3b971d176dd3103766ce7ed77733a2d0f85d03cc13c6dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:24 \u00B7 rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts:61 \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":"rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e323748620d860932323fe2a28c3e0ca34e7c914f3d7ed54c48a5b21479ef89d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/index.ts:839 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/index.ts:855 \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":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef3a1fd530c79501ff5c1b8d47ebc77196c0f2ff988dcc612c6223f6b084175"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/src/keys.ts:225 \u00B7 rivetkit-typescript/packages/workflow-engine/src/keys.ts:251 \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":"rivetkit-typescript/packages/workflow-engine/src/keys.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18b5d9763e2761d33522e065c8de6bae69aedf1b1c30a6f05b9156a4851afb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): integrations/flue-runtime/src/stores/run-store.ts:104 \u00B7 integrations/flue-runtime/src/stores/run-store.ts:123 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/run-store.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fc6d8504b1ca30a2818fdbfbb301698c2e13c69d782cabb3ebc0eb741bb7dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rivetkit-typescript/packages/effect/src/Action.ts:60 \u00B7 rivetkit-typescript/packages/effect/src/Action.ts:76 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/Action.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"996cdd6d82ba32f3a11a81e9fa19af8c83b1b9b553d37975ffc2a77e7b30301b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/database/config.ts:128 \u00B7 rivetkit-typescript/packages/rivetkit/src/common/database/config.ts:150 \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":"rivetkit-typescript/packages/rivetkit/src/common/database/config.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"96948df5e142f9ecf6a0a67ca2e450dbcfb503dcb2c9b97d91cd8522e364a6f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/schemas/serde.ts:553 \u00B7 rivetkit-typescript/packages/workflow-engine/schemas/serde.ts:603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/schemas/serde.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f8dd0560c0c424d49b31aff0fb11c8c9e9bd98ab1b72a58d59c83ebcf2c2f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): rivetkit-typescript/packages/workflow-engine/src/context.ts:912 \u00B7 rivetkit-typescript/packages/workflow-engine/src/context.ts:1201 \u00B7 rivetkit-typescript/packages/workflow-engine/src/context.ts:1293 \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":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3efcf401452cdcfc05a00d06841543bcc17e90099438bf695d2d9471da7739a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/src/context.ts:1094 \u00B7 rivetkit-typescript/packages/workflow-engine/src/context.ts:1113 \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":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52a09d8d66acc7d51b331f904d436bf097aa6b71c80d864faa8cf112e0be2a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): integrations/flue-runtime/src/target.ts:37 \u00B7 integrations/flue-runtime/src/target.ts:46 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/target.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdee0d65c6e47347432763a561d3b710feb0224cf0d25bfd05936bfa7a49cf6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/client/query.ts:29 \u00B7 rivetkit-typescript/packages/rivetkit/src/client/query.ts:42 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/query.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15fedf7d29baaf2fdf563115e1efd0ef1df6b82c8ece185e5cbf518f08490c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/index.ts:1218 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/index.ts:1229 \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":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"399a1c7a04b889b544917536c895a6bf01914ecb5eb33fccb30112834ac9c17c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/publish/src/lib/version.ts:262 \u00B7 scripts/publish/src/lib/version.ts:316 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/version.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a120d6152a40098e38878caa232023585c009717e5991be457108412331861"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/schema.ts:240 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/schema.ts:265 \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":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e15f520548b215c431c4d1ad8c30073c3523c4a190a7e7d0014820f0407348"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): rivetkit-typescript/packages/rivetkit/src/engine-client/actor-websocket-client.ts:114 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:2404 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:2509 \u2014 the 3 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/actor-websocket-client.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4965643e4220cef73fa68e4b950e6fbbcebd92f7ec0016853ecd2f9660fd1651"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:2546 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:2562 \u00B7 shared/typescript/virtual-websocket/src/virtual-websocket.ts:170 \u00B7 shared/typescript/virtual-websocket/src/virtual-websocket.ts:188 \u2014 the 4 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"4290ecfb1f728db7fed10ee386d58777218085a77384b511b270fbe0173694eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/src/context.ts:574 \u00B7 rivetkit-typescript/packages/workflow-engine/src/context.ts:1535 \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":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3154df39d1ebeb3e34d339b74e6be362c908423e32ee17ef65c3c0712e8dcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/src/context.ts:2821 \u00B7 rivetkit-typescript/packages/workflow-engine/src/context.ts:2882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f761f9a5fefdd9c07136a90f732e5b1d91f6b48ac97ad3d2ff5901db7ccb4f0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): rivetkit-typescript/packages/workflow-engine/src/index.ts:408 \u00B7 rivetkit-typescript/packages/workflow-engine/src/index.ts:447 \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":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6f84f5154afcdb8bc953ff76e36bff3d9e84a4ccbf0d7cd61d2e75270b1c73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/publish/src/ci/bin.ts:327 \u00B7 scripts/publish/src/ci/bin.ts:417 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/ci/bin.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"73104ac63ff9d8680f640ae5e73f7a28e626c7ca5e454754835995425e0f68d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/publish/src/lib/context.ts:62 \u00B7 scripts/publish/src/local/cut-release.ts:44 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/context.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82b011c09e0f4c375ca378810d632e563f7e60961f6c8986ac258004c1a9952"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/publish/src/lib/npm.ts:146 \u00B7 scripts/publish/src/lib/npm.ts:165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/npm.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c22e5ef74384f9cc20b3cac6383905864c2a555ba6cce832708ba6abfbc5a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rivetkit-typescript/packages/effect/src/State.ts:219 \u00B7 rivetkit-typescript/packages/effect/src/State.ts:231 \u00B7 rivetkit-typescript/packages/effect/src/State.ts:248 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/State.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ef8592c2469d1ff7d4dd83c79da3a9dcf8c3c402f004c27d09f34a0396cccc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/actor/keys.ts:235 \u00B7 rivetkit-typescript/packages/rivetkit/src/actor/keys.ts:276 \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":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2059f49712f0f7b04f82a556df9a3bd9ceec1b4946f6e910f2415c7b8341c08e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/common/eventsource-interface.ts:38 \u00B7 shared/typescript/virtual-websocket/src/interface.ts:54 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/eventsource-interface.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a2a22ca057f130bc1d8574f48525c2b0f55e333b6682372fcbc562f7e1e9c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): rivetkit-typescript/packages/rivetkit/src/engine-api/actors.ts:14 \u00B7 rivetkit-typescript/packages/rivetkit/src/engine-api/actors.ts:36 \u00B7 rivetkit-typescript/packages/rivetkit/src/engine-api/actors.ts:48 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-api/actors.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f69c834d5e41cc6e288f1e9259131b9a4af93163befd1179510ea7447f3e9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/registry/native.ts:4922 \u00B7 rivetkit-typescript/packages/rivetkit/src/registry/native.ts:4964 \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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4922}}}],"partialFingerprints":{"codehealthFindingId/v1":"640fc0b98f844f8c59c6f73cc12dad17e0b37c8a1702101aaabe0a8f6a22d67e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts:219 \u00B7 rivetkit-typescript/packages/workflow-engine/src/storage.ts:426 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d2ac6984e6287ebb38f616dc644b5c779f9b80440b77b44125f918200b9096"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 87, cognitive 127): (anonymous) has cyclomatic complexity 87 and cognitive complexity 127; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d6d01622a7cc99143ce7bda36b332249ee6e1b628832d0f64467dd5f41f016"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 72, cognitive 89): (anonymous) has cyclomatic complexity 72 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4274}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf75acb99e3ca0e9180d5cbaafe134fac53b71953e22ffb3c668979f3dc9a25e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeRace (cyclomatic 45, cognitive 73): executeRace has cyclomatic complexity 45 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5605b6c2e3f999652733631a7f73e76ec710dd8c5317251b51e5612f42f33125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertJsonCompatValue (cyclomatic 42, cognitive 46): assertJsonCompatValue has cyclomatic complexity 42 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b29d0cd83b0736d1ea874f6e2fb2f0b5d892c44ca595ec0740050bdf5028fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bumpPackageJsons (cyclomatic 36, cognitive 83): bumpPackageJsons has cyclomatic complexity 36 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/version.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"406ba314f09d49b30b061ea30c80e9baf06f5341c3f4b8ea41dbffa15232bcf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeLoop (cyclomatic 35, cognitive 58): executeLoop has cyclomatic complexity 35 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efd1a00c29a0dc97599a166000749c12c3c25250a0ca1bc3cf7d370946d9469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeStep (cyclomatic 34, cognitive 50): executeStep has cyclomatic complexity 34 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"11044acc84133cef49968f9c10fa800c1afff7af1246dfb9fd884453470aae65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 28): (anonymous) has cyclomatic complexity 31 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"784c06e7ab4c91970a8917e0c38049bc94976f667cd0ff763db92803058a52e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNativeFactory (cyclomatic 30, cognitive 27): buildNativeFactory has cyclomatic complexity 30 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5f714d68a2caea5b5c53e6934ed623c8ade0929992bc4c0064479e36f52bf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #handleOnClose (cyclomatic 26, cognitive 54): #handleOnClose has cyclomatic complexity 26 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcd7fa2bc343d04eda32043925720045cf0fd2fcf456d80539ed3e78e794bbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeWorkflow (cyclomatic 26, cognitive 44): executeWorkflow has cyclomatic complexity 26 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c50fd56f6176cdf2d276ed574fe2f59251795fa3008c671b05350754b07770"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushSnapshot (cyclomatic 26, cognitive 34): flushSnapshot has cyclomatic complexity 26 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3303eb223439e49e3b6376ba2d826644e9a2e9109d44d1ebff0948b58ff8d25c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodeJsonCompatValue (cyclomatic 25, cognitive 27): encodeJsonCompatValue has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"537bf2f0bb5bd2c862cac4a23d68f3edd58a3f6c5aa5ad59e783d14fe58870ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 23, cognitive 36): create has cyclomatic complexity 23 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/index.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84774efc24cd6c2f5d55b6b2480e4d9061a55dfd5fcea5bce0fae1af5574b62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyActorError (cyclomatic 23, cognitive 19): classifyActorError has cyclomatic complexity 23 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3386ae7c57fe43a564012778511b21285dfac473a33872cfd6a1eadbe59db4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishAll (cyclomatic 21, cognitive 19): publishAll has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/npm.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"54de32b058cd2d3912e25e5be18ac7a024b50d6e14d12278d46b6eb310a4d05a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unwrapDeep (cyclomatic 20, cognitive 35): unwrapDeep has cyclomatic complexity 20 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/write-through-proxy.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8aadda7c8a1de592bf67fecd4e0f974273e94b9e050f116011b90f71ebd270"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 20, cognitive 25): main has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/local/cut-release.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0804349a929d9c05f39d8b00c62ef011151edf5eb9c4d8eab57a41a81dbe827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #sendActionAttempts (cyclomatic 19, cognitive 33): #sendActionAttempts has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"229aa154995dc613e794ff63884a09d6f50d4aec938c6e7e855803b125433bf2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviveJsonCompatValue (cyclomatic 19, cognitive 33): reviveJsonCompatValue has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bfb0ae346007856967dfc771ff8bc30a67cb18dbe7f21088c7da32d08db8ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #fetchWithResolvedActor (cyclomatic 19, cognitive 31): #fetchWithResolvedActor has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8044e457fb12ece093f23552cc0d0eed88b8b478a6ff89a15a7a32f669d17a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveContext (cyclomatic 19, cognitive 22): resolveContext has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/context.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ee319dd4ce506798a6527d85741e15a5feaa06da1630bb9846257d6aeac6f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 19, cognitive 18): (top-level) has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/contexts/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"566344e9e54185a4f709869c0c5c6642449151745eda2c5bf5ecde56264b2ba7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bumpExampleLockfile (cyclomatic 17, cognitive 37): bumpExampleLockfile has cyclomatic complexity 17 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/version.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bae829009cac8c5deaa168a1c8056c49469af40071cfa3777d7c6f47165a55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #dispatch (cyclomatic 17, cognitive 28): #dispatch has cyclomatic complexity 17 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/typescript/virtual-websocket/src/virtual-websocket.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdaad524b36efa6e7c08f0cc685439b9fdd64e99c91de37b3f929580ba3c033"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeQueueNextBatch (cyclomatic 17, cognitive 20): executeQueueNextBatch has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20184bca52f411b7c4486e09462c0ef01452410b1fde99b070f1b2ac2e815c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeLiveWorkflow (cyclomatic 16, cognitive 41): executeLiveWorkflow has cyclomatic complexity 16 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca2b86740386c813b51f9baa5646dbfd2a0e61f14743e1ed793c974ce0c85eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function anyValueFromJs (cyclomatic 16, cognitive 20): anyValueFromJs has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/otlp.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1322dfff8501c7796708f423a904fedc31cee0f77d70962a8d84ba49c0eadb1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeRollback (cyclomatic 15, cognitive 29): executeRollback has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9832891c82dab19e87afab26ec969ef15caaeea6ed0ad2fc65ba1679b07cfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #handleOnMessage (cyclomatic 15, cognitive 27): #handleOnMessage has cyclomatic complexity 15 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"23544a89ea4e12702053d4a6ef99767cae010233b9966403d0ac85e019f98e90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendHttpRequest (cyclomatic 15, cognitive 22): sendHttpRequest has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/utils.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab8057f743c805a49eac0a654835d47ad44695798b1d09ad413c1907f43d3e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discoverPackages (cyclomatic 15, cognitive 21): discoverPackages has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/packages.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e79aa36fe514999e4f286b784930d1f8bce757df8c589ef8cad6eccd9ee40e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileSubmissions (cyclomatic 15, cognitive 20): reconcileSubmissions has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/agent-coordinator.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece0b62744c63054bb4dd507f4651d7f42ab624a96dc1921fe8b78d77106ac86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildActorQueryGatewayUrl (cyclomatic 15, cognitive 20): buildActorQueryGatewayUrl has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/actor-websocket-client.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f76153443a77de8952684a3de71321f8cd7ec2427b56156f78f9a0ce9478f0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d02c1f85164c14da5507122323eb53736e79ac4a48bfb1677a0df7f3febc19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rawHttpFetch (cyclomatic 15, cognitive 16): rawHttpFetch has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/raw-utils.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65b7d62bcea7922b0857c849dee77c7f05907185afe537604dbd26e5b1d7fae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #shouldRetryConnectionOpenError (cyclomatic 15, cognitive 12): #shouldRetryConnectionOpenError has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bbdf77f90c1fe710692fa6586d500f163204446370bc52bb3b6c2f690ccd7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 25): (anonymous) has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17530a6e93b8e37859d44d49b89211fb37bcd3b45bf92436069d9e58b5b52d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserializeActorKey (cyclomatic 14, cognitive 21): deserializeActorKey has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8620338f824ef6b95be3a2d3ba7a3195f91b57774fd9a9a97310f5f190183e5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configureServerlessPool (cyclomatic 14, cognitive 18): configureServerlessPool has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/serverless/configure.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b9a769506e630c7bd016a165f34e7f3749ce4f008fdb863d16dde7ea7a1013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 14, cognitive 16): handler has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a085adb8cf4fe5e221b4f96a8f8de73ac1ee58462f32bba95ebe6daf13f40c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/devtools/src/hooks/useDraggable.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d85b8e12bcc8867486283bdaee3749ba42353d6649d5892bf259fdfb9aa7521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHibernatableWebSocketAckStateTestRequest (cyclomatic 14, cognitive 13): parseHibernatableWebSocketAckStateTestRequest 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":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b73c3c3c69d043995da20f25cec89a96fcc98519eedffc79dc2353a9e1281f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractMessage (cyclomatic 13, cognitive 26): extractMessage has cyclomatic complexity 13 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/logging.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a87de23c6dd6e54124184ba2136f03e01287239d020780fe55185b48e3298be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeRequest (cyclomatic 13, cognitive 14): routeRequest has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/agent-coordinator.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3a59a8a0bf0ea46289ddbad3b89b52979624592998470716180f990fcd6be7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #printWelcome (cyclomatic 13, cognitive 14): #printWelcome has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"85030f8a1c2dff942f5be0edddf0f12b30180e8236567c85cc362969a7fa7fae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da0bc751f309667fbb895b20a4c0ee89f20f3932c8155e784744b3218622f53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/unstable/migrations.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"488b6d761a50326f805358df3330f5948c3d145afe086ca9ab1ae60365437b74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPendingOwner (cyclomatic 13, cognitive 12): verifyPendingOwner has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/hook-token.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"839dd4094c35b18ff19e8e8f05ac6c7d49b25f10346ebd1433477303fbe28472"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRivetErrorLike (cyclomatic 13, cognitive 11): isRivetErrorLike has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/errors.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62d359955e34301d9d7fe3451982c4848fc2e3b4a56f9f8c5e4554a86472ab8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d363b9184acd588d2a9f49070baaa57934ee8298272e5d603fb8c05c7635136"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeTry (cyclomatic 12, cognitive 30): executeTry has cyclomatic complexity 12 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc87190b2118256e710c9403c11b5ee2483e716d66a35c5038f9d3daf462ae06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #sendMessage (cyclomatic 12, cognitive 21): #sendMessage has cyclomatic complexity 12 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5a4055303555c85348fdcc31cf383a5d47e7d5f8339b20dfced29f78a3203f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #setConnStatus (cyclomatic 12, cognitive 18): #setConnStatus has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d630c39d98aca988d931d8b75048594330f1d09338b84cb625efd11b50d103"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deconstructError (cyclomatic 12, cognitive 18): deconstructError has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/utils.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d776be445b02f7cc10a15bc3db16fff5ecd37d1ae052b24edbc6a68514f9b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverDispatch (cyclomatic 12, cognitive 17): deliverDispatch has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/dispatcher.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4391b897bfdf00af774ff7d7b60eb6d706418fe09710c97a80cc3be38ed80f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":5634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e83dca3990d61b3959069adc7c36da2e5d1a45d4caf7c25def555c62cdfc21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeJoin (cyclomatic 12, cognitive 16): executeJoin has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f52a36b5dfb9822a7658691116645d98fb71f02824ef6ad8ac989bd440f83b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #printWelcome (cyclomatic 12, cognitive 14): #printWelcome has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/runtime/index.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"22175c0236d432895b23f8a1d3b097be1ffcdccfd58409f79c17ec9233336bbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRangeWire (cyclomatic 12, cognitive 14): readRangeWire has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/traces.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31c1a4f95868d9d4ca80454beafb94769b7a706492328537ac8ded94da57e36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #dispatch (cyclomatic 12, cognitive 13): #dispatch has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92bb8351a0f2f9498e0d0c1e2d1770166f512dd2bbb393c4bdd7da564a59eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getValidationSchema (cyclomatic 12, cognitive 11): getValidationSchema has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a097b9a9052d11c04d29790f0e578d65a4f2d956d605d7c7863192978ebea84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryParseEndpoint (cyclomatic 12, cognitive 11): tryParseEndpoint has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/endpoint-parser.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfef7b935fd40356e1e644c0b48c6577f5661b222e71b246464a709db3a7d28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startAndWait (cyclomatic 12, cognitive 10): startAndWait has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"da79620bae1dedf9e26cc498901df583bcd03e46fd3d92ee0c7adfa0ad7658d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reserve (cyclomatic 12, cognitive 9): reserve has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/hook-token.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c623f171359d42272c024754a2b0e6a2139cf0ea190de5d9c7f0e332652d37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryOnLifecycleBoundary (cyclomatic 11, cognitive 17): retryOnLifecycleBoundary has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/lifecycle-errors.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a32b50ddd34eafb2e3883658e2ce1b7d677ef349e9e1e271c5b0b113ff7440"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractErrorInfo (cyclomatic 11, cognitive 16): extractErrorInfo has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/error-utils.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b76b0d5de20f85e105916ab2c1db82e977ea8022452fe713a443a4783766c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildServeConfig (cyclomatic 11, cognitive 15): buildServeConfig has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":5728}}}],"partialFingerprints":{"codehealthFindingId/v1":"43244a4793d0b682820f92125af5bbbd27d5e1a94675f8f9f13906187bc61932"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toRivetError (cyclomatic 11, cognitive 13): toRivetError has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/errors.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f773bc1681e39c6a5ebacba4d0cb42469c7173342cd19bcefe7dbd21b9d07dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8af75cd858aac99bda2cde488fa291a5abf5e5d2ba2dcaec525f2c4e56d80b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listen (cyclomatic 11, cognitive 12): listen has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e021dca81951a1224cd3ff93b3ec55953f42f2a57a5582f2cb57263930059b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #buildGatewayUrlForTarget (cyclomatic 11, cognitive 10): #buildGatewayUrlForTarget has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/mod.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e54c14f7dca11060b8f7ff51a290a399a69d2803a508cbbf5ff746a454072cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNativeHttpRequest (cyclomatic 11, cognitive 10): buildNativeHttpRequest has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native-http.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd2df0f482cfe059bd80d8ca1fff8f99f639bdc427b810b9abc3d08d4360369"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateQueueComplete (cyclomatic 11, cognitive 10): validateQueueComplete has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native-validation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f806bd7395a45aa14427776f411fa86129adea8d077980c048c982d665f6716a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toOtlpSpan (cyclomatic 11, cognitive 10): toOtlpSpan has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82d93fba84bed5872d845640742a8c7c43dbeee0dbf5f49694dc58fc8db34d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectLoopPruning (cyclomatic 11, cognitive 10): collectLoopPruning has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"917616320b38f49e87329909e896763febbb146a1efa4d26de4675fb6a2ed920"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveVersion (cyclomatic 11, cognitive 10): resolveVersion has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/version.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae8508b302d4cc2a9f0d1d57f77698a93b12cc506d6f22e7971a36e906d25e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isCanonicalStructuredRivetError (cyclomatic 11, cognitive 9): isCanonicalStructuredRivetError has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/errors.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"da71ae24060056b49b9617e4ad98894ee1eebbd0b9dd041b95826a6f02cb7df3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRecord (cyclomatic 11, cognitive 9): applyRecord has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b4a9e4f5c34b846e99ca40397ab8047b4fbab4f316fda769a28761ae2cd409"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts: 5487 lines of code: rivetkit-typescript/packages/rivetkit/src/registry/native.ts has 5487 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":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f754dbe5511fe724818f80c40350790b148dfd75aef8c12df0d74057bca83d"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/workflow-engine/src/context.ts: 2624 lines of code: rivetkit-typescript/packages/workflow-engine/src/context.ts has 2624 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":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95c5b779217629e80a1599b6f7d63ff558d4f0a59093fe84de2b48900a4423a"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts: 2438 lines of code: rivetkit-typescript/packages/rivetkit/src/actor/config.ts has 2438 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":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a045b3da451fa598e88d0e984759a0ddd2ea1bf0f385f1f66b90665f935e0370"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts: 1589 lines of code: rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts has 1589 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5375135fd0cc3eee613283ab10ad58b559d5883488784f7055271304706111d"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/workflow-world/src/actors/workflow-run.ts: 1433 lines of code: integrations/workflow-world/src/actors/workflow-run.ts has 1433 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":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7f91a0bd5289985060fcd7cb10ade426233104f7fb4db155b8ae00679f0f48"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts: 1169 lines of code: rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts has 1169 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":"rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f4fb33c65a8f5c9f03a858abc7144466dca2dc81b3fdb4aade8aa03874acad"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts: 1168 lines of code: rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts has 1168 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":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ea89a5a12625244e582af57d53e9e5bca0650a2202d5f25fad2ff3761e71f8"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts: 1159 lines of code: rivetkit-typescript/packages/rivetkit/src/registry/index.ts has 1159 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":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b8b2d1cfab4a2756e4f8690f779cb3f47d7ff907de33040ef04ed8af036a37"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/effect/src/RivetError.ts: 1152 lines of code: rivetkit-typescript/packages/effect/src/RivetError.ts has 1152 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":"rivetkit-typescript/packages/effect/src/RivetError.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82e50fa4be051f9480f2774c36fc1b730b5117d6210484419052e4172eaff02"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/traces/src/traces.ts: 1137 lines of code: rivetkit-typescript/packages/traces/src/traces.ts has 1137 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":"rivetkit-typescript/packages/traces/src/traces.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"129cab61f79ccb110b6b95dc07951b1f4cef710e50abf6c50d1410f9043e789d"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts: 1089 lines of code: rivetkit-typescript/packages/rivetkit/src/workflow/context.ts has 1089 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":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98dc865a045ad9a7104bcc5710141ffbb51debaa57a044aeb3199ef3919905e"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts: 1061 lines of code: rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts has 1061 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":"rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97393a5cb4661f35882c1c43a0b75f2afa521656951d84606609b7941f645b81"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/workflow-engine/src/index.ts: 1057 lines of code: rivetkit-typescript/packages/workflow-engine/src/index.ts has 1057 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":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e069813e0c274edbc737441278c85c3cf571a440d0c3494de8954a0249dd618"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts: 895 lines of code: rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts has 895 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":"rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b276757fabb22278bdb1185dee149e00db4906788b9ee8d341165423d6d16af4"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts: 764 lines of code: rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts has 764 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":"rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f2471cb642256fe5c30dd0afd3d04164b5c231b32f4b77c8bed9dbf44c9181"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/workflow-world/src/actors/dispatcher.ts: 756 lines of code: integrations/workflow-world/src/actors/dispatcher.ts has 756 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/dispatcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb13f66bcbf6ecacd609df7844334d8d26341d14e32ba6b5d2e7d9717e0dae81"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/workflow-world/src/index.ts: 735 lines of code: integrations/workflow-world/src/index.ts has 735 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":"integrations/workflow-world/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"986050e4f805e5815405c017b69f5f1d5e9d6e1c56aeff9c5e51264127faee28"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/client/client.ts: 688 lines of code: rivetkit-typescript/packages/rivetkit/src/client/client.ts has 688 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":"rivetkit-typescript/packages/rivetkit/src/client/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8acebe81a96885576e3ff4fa4ba58142bb560658a87d33dcc70fd9862740114"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts: 628 lines of code: rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts has 628 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":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"941a0a135717a9517e5dbf47869019a0bdc217f8bb972f01a9e1892e2fe322d9"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/engine-client/mod.ts: 623 lines of code: rivetkit-typescript/packages/rivetkit/src/engine-client/mod.ts has 623 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":"rivetkit-typescript/packages/rivetkit/src/engine-client/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dc5917803d07453f2e4feb28f8bddca21aba982ddf0d15503ae6dd156e0d1a"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/publish/src/lib/version.ts: 593 lines of code: scripts/publish/src/lib/version.ts has 593 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":"scripts/publish/src/lib/version.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcb68eaec6e4cbd6b09d89850a4388b5ea737d2f6b3cecd39650c6da07fea1c"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/workflow-engine/schemas/serde.ts: 574 lines of code: rivetkit-typescript/packages/workflow-engine/schemas/serde.ts has 574 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":"rivetkit-typescript/packages/workflow-engine/schemas/serde.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804dd2ab8f0cebd7327aff94a27cc998cc10df8f7483c9e0bbd59b94a89d2f18"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/workflow-engine/src/types.ts: 563 lines of code: rivetkit-typescript/packages/workflow-engine/src/types.ts has 563 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":"rivetkit-typescript/packages/workflow-engine/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc34e1b8b3f51a2d79561f9920030521e46ee1cca10125b0649f64eef669208"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/effect/src/Actor.ts: 560 lines of code: rivetkit-typescript/packages/effect/src/Actor.ts has 560 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/Actor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38e60fccb3fd32223bfb6be8da8ff296d6464e784c3c06b6538ebbe064ca665"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts: 547 lines of code: rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts has 547 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":"rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"923f0114b2d0a5841ef4d19f31e0499b658c5c68df191e4b2dc0905302b0f80a"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/workflow-engine/src/storage.ts: 531 lines of code: rivetkit-typescript/packages/workflow-engine/src/storage.ts has 531 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":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"690bbd48eae2146ed60b1bb8f9bcf9f3cbd0010803a677c1fa857f9f017eec5c"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/publish/src/ci/bin.ts: 504 lines of code: scripts/publish/src/ci/bin.ts has 504 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":"scripts/publish/src/ci/bin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4070898ecc0302bbd9bee977f989b89e9401f91a0523501fd62cf978b350f9"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts: 464 lines of code: rivetkit-typescript/packages/rivetkit/src/common/encoding.ts has 464 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":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348c90d8cc8b6e3babba630e749c288771c9e9b1cdcde009556994ffd5c56cec"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/framework-base/src/mod.ts: 457 lines of code: rivetkit-typescript/packages/framework-base/src/mod.ts has 457 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":"rivetkit-typescript/packages/framework-base/src/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5456b904b4c6adaece2e1827b57b8c59776f6d06c3dd89d99d2453d068eb31d"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/traces/src/read-range.ts: 453 lines of code: rivetkit-typescript/packages/traces/src/read-range.ts has 453 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":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71854166494b4e379feea2c4d758a2b1c1dbbbf0b0224fa81cf9775767bf4011"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts: 439 lines of code: rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts has 439 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":"rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e21a730214f231a896f09503b761b3a116aa11c73b7d26027d6e38fa56e19f"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/actor/errors.ts: 427 lines of code: rivetkit-typescript/packages/rivetkit/src/actor/errors.ts has 427 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":"rivetkit-typescript/packages/rivetkit/src/actor/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb8dee4221d211c633aaaf49cf40535142e2b8af0ec68c769487368e8241f8f"}},{"ruleId":"R3","level":"warning","message":{"text":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts: 416 lines of code: rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66319eaf85a337277565675836b1cf296d084d7b72768ee7bf151e5337b14bd3"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/flue-runtime/src/agent-coordinator.ts: 402 lines of code: integrations/flue-runtime/src/agent-coordinator.ts has 402 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":"integrations/flue-runtime/src/agent-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4ff4fa66138b8a49a879f3be576845495f2e31fec0a4d7ae4f36c0f79ae348"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5301d0b02fa9a172696f74862a8f603139af64caa89db8215cd204087c9cd152"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60a9940e703f1747d81839fcca68e035c3627b1a9d136876a153b0156997df1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cdb418a0411a27da1c8d1f8af1f4d1138838e8dcd342445ba65634a4a144d5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/workflow-run.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"507bac380e62c48dfca143714d4e7f71d5c39351567a4f02230fdbf38803933d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/napi-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5349147a8ff677855a6bdd3a3b827c4d9ee74189808380c53c9ea4c828f266"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b247ebc2c6c7048d5e8a42bf5464f21f87837d631866d793da2508ccb15cdbcd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9518d5aaad8a3ab23ceff8bc2ec118593012bd488c54b2fc9811fb7f7b257068"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/traces.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bddb29a08ef02fd944ce6292d86ec538902539d2f4a21868d4508f0505f10e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/RivetError.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a684d8cf348becc3c93846231e5cb574a532ab8822cd87c0154f559586e7a35"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"521ebf4db23ec83fe2274072a5aae5b37ec8fa375e349163f885899062a6296d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bddd70a3ba52de9cbc889843b6317711ccfd35f40f9abf46292b135a54c1cc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e38abfdaee07cd3f82667be9ed62db5e62ed25f17f270cdc8f39ef744ea45f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd58187a282d04b3602359381dcb32c2da2c986547434d56d08c93542cad863"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e332ca825e033d1ff1cb718c6ec2b1bd930886085150ebc2f914da6397b661"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/dispatcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfef73d5a52a2e6b01ddc21180be023f46cba2775f19b5d65b0cc61a195d6ff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f9e73234fae0d4f4ef50b61bdf3f9771d173eeb2118227a917dd8a09d45b3c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/schemas/serde.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"263f5ed5b4cdad977a237e75909bb265cd0fba6695e6c7787556ef15592e07a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/Actor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"371ca42aff9c878f4a7c6aa0fe324fbee44055b9810aab713fa02fc1bb44b1cc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/native-database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86842c80519037aff59ed8982dd4e3c72a7836af86c46c9486f2011df1cb19c9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"687f4e84c43fd995d7bec10d35cb131e201f733e00a625634f7b8c765d1a5915"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/framework-base/src/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ac7105c507a1f9f0fee32303afed65d260a570f1be533b335837a528b9e35e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/driver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c36268e5bf1b5f2be62cf53a8d5ff9bb26887b0d67b387d3aa88e4e429e1c1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cc1274380c9006d35d9bc96343544afd8e51d983b33c9b9a4fa4d50c3f8cfc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/agent-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"929754a76624e9e7e4f59eea60d9120b9493e2c437004506ef4d8bf3fd1ba0a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/db/drizzle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f7b3090120d35d244bb94d50c0eed073cbf5db2f2a876137e3da86c5435dd0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/target.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"266f1f87d997937ad0028ea1ca3ff3667ab43f8749cbb0e552484c0b8625da4c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/State.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b814a75d5619e91a240d7581761d31120912932d8ca6b76b3124c90a12b35a2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v4.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"678ab60103a5a503519a2e7710ef53e0b8377cad221ed94806fd63efde522c2f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/submission-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2672c1fc2f9a7f78aa0598019c8d9afa45d301402dc71c393dd585cec42ac3bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/inspector/client.browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e747e8cc60366010de5b7ac5b4ac92df67ab42ef5ed8c46ccefc7911427c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d5635feb3fac5f3fe5ede9b27d77440812006986dc50da5a5e89d678377b56"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"708805f6179f12a7da364d731be90d5428f2b7816845973d02f58914a367ce3b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1782024e1b6efb11b29f9a51937399c41cbfb0df5d6bb361cddae17b6b1ca75a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce64a3749da96517fce4de8f1b907cee8dd930d76d6435d1b9c40dd5ba039da3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/testing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ac0ef09348bde5950af2635e7dd16e7a0154009db7b2d5003eb4bcc2f9a33f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/inspector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f292417666bdc2885ddb399496344b8c403986d4f7f0a5cf50f3242dcdcdb2de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/typescript/virtual-websocket/src/virtual-websocket.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8498386872612d1a94826b889e7367dc1ce9e137ccaf81d3d4f6bd875be17759"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/Registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"180291383aa991a3227d8eacf56efebdeedc120a21ad5ac2a9a4b1eeed7c7ca9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/keys.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34daf81c6e5546ede011e70d712551ca432ac93b2f02fa942a4fbf2ef836a6c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/inspector-tab/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"865ff5f48ebdf37e0cbb56c547e6847d62ebe373774152285e0da60b7a8201a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/dump-asyncapi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8892c2ca7bf77a01ca1513839d241489eb709aaae7fa87536059df5eeca9d4de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/db.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82baa9b7beef4e2f5bc524e6ee94e5a3fa037e66b380bb4885c20190c63216e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbddf230457e3b27c1addedbac99b351c7ea6ec0ed560467515ac456aa30e5d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87977e60e0200a66fe85861f8353b9b606bb92dcf82b6f0574f937563e2bf49"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v1.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84d2e20d32c2ad60ddf80b0c292633bb3eac022eac8fd78e960ad4ef91030b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/definition.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94c563f8a00e6dc446dfff53ced6e690042d2eaa752666f089778766a7c748f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/workflow-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e3272b5522faf0d5f72a8ef277a7ce7c69a68df0b105a1b603e1b6e070a3aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3f9ca66933186f5994ecf5acd51fa2a27b3cd1c024a567fc1ff94fc535ed2f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/hook-token.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"beda2416e3d51d4551b39fb2b0c74f4c45d75079fdc6ca98af7a592319e95b42"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/Action.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96105d86fa65d006c1ac1c8944660e083213f64433e9dfb5d4bb5f792876f52b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native-http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa14871de53c2971407252fd1e1b7a1f268ea69938b41733723b560fa4f2e72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/inline-websocket-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"544a6e52bd84f6e0af56cd6fdc7d3a71b4f3793bb1c5161188315ccb540bdcca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/ActionDispatcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f89345cde7b02e83db18b1e5fa7b34b351faeab8d0c3705173a4859e9f3fa6c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/run-handler-coordinator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92141b5800ace0c5a1eb8a8a1f1ff1156fa0078c53695a1ee5cb5edd14bab2b6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/Client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cf735230488ba51b8a2ff13712cc36ab0ffa46a3f01bf406b58f2cd388ec91"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec00e9afa584a926259a46bd4496b0fa5185c387c5fd824fa7c54a5735e2a7d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/streams.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab82961c8642fce3d869063a388890325868b66ff2a1e9b487cc9c26222da214"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/event-stream-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d4a37b525e34b0f18e6ec174d87c79034da82a8e80045bb966abec04c8dd45"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"321c9c1b3493c930a3c0567de6da04a3895bf9fac34838e36c10ad1ad51f0790"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/logging.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f0230ed194f0e16072f2ad6d3f581b8f9af4a99c6fc158a48c007b82627753"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74d69b7d2c7ff1b0d8977a85ccf30ce8d5398158370bb9233ee5c247ad82a7e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/ActorInstanceManager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ba3975e6e452f51e1a385038cab25f08b38f1a38c5f73d93f774e2afc926d0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared/typescript/shared-data/src/deploy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"183bb44f21d6d8e8891a58d9be1b247af68b3617d5c46a9e6f5f6d7abe5177b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/devtools/src/hooks/useDraggable.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ead3abb8621ae016060c2a757def094e72022d089c05091b25f4d947b24cc0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/devtools/src/components/DevButton.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2af1cf636b97c319255ee0f094567320cec5d42294e4bcd63038e3a62fdfce7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cb327fd136d9cf4001435ba6175bdbda2d2ecadc167aa1bd3649d254dda127"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/location.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d26a80b9d98ea776d58f8eec28ddfd145e94b1fe44bc34598ef89496817342"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/otlp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b048efde9d1f94efcc3cebdc1e1ee60f1802733fc24982c5bc0b26674998df04"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/runtime/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa15f49f13377fa0b46419002a2fa8f49b976a1c2de001900759e523d04d942"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/run-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba8cd0ae0f3b9267c84064d55e99df6e1bd82983f4dc7d0042fa2528bf70e41"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e737a85e127738713d8d39ce0e8531dd481c4c7b2f578df24b344198b02daeb1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/actions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc29462c51dad6fbafe2a5059c9054e1b26bfcf78e7397f221f8eec18722167"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/shared.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbd134671ae8dee694a8fb78eb790d8e6b5ae2ed9695e7606ea83d6d2fff60c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native-validation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e07c7446cff018fa303500449101cfa351dd34ee0c9b6c8f4aa260ce86e61df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/write-through-proxy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e4493984dce8007d14fea65f1e2af4abf93546e9520e1d84477f718d838adc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/unstable/migrations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ae5fbdcd110ce275373c9e261297cc67539c53780fc01d1e385a3b62bf7462"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/react/src/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db50b898ce3611759ae224178e25ba818cbe10f4a420f3733e26a87d059e888d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/scripts/compile-bare.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4740a01e8c5afe65b750f7a4cef3a8a2dd5b5decfdd428f75888c333f87f682c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/serverless/configure.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"979d9566adde70be6daaf3213995340703b8cbd6db7cdbf5a0b4f5153ba6592d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/hibernatable-websocket-ack-state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf98e3aa6eb4564efa189a8dd08b70c0ac58b8c5210da00347477543ec208db"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/scripts/compile-bare.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bb2047d48a99647dccfe6f83a7da67f9019150b5ed22e2cf5e2781cc899ae1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/schemas/versioned.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b653627a0950ce3f9e7b7c743c07e94301e75010cfa631167ce32eeedfdfd718"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/scripts/verify-inspector-bundle.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fa2916f190c148e372a0da6d68e6d5f01978b20c2b8fa04d89255a3d0595e4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/query.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b34b95706fe66a5e2b3c6cba98cb30a320bf7c0dbf364da2261bc87655b6c9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/schemas/versioned.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af7177e937327836b2250b45e2019ebdce5bb7a4c89262119c1d7af93df9a35"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-api/actors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"258b87be85ba70cd37bcd688e1f943e88192d38dd7b2ddebf7fc1d7a169f4bc2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/engine-cli/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dbe08f0f1f35d081657d4ed25b02c982e5a4e1b91d137c826374eee183f2e7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/devtools/src/hooks/useCornerPosition.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5072ad59b6df5e013c8003e4896cc8c3ed64934b20275c3ea58bdd151df16c63"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/noop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"228730179f5d475db6a445158cd5cc6cf7e17da0a4c784e8036c0b2a37b7dfa7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/error-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ab919481fdf4765137fdce413a438384ca45f453824a79ab636227e6f58b4a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/rivet-db.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19450f240bb69f41124efd146455ee9215314e5f1993919f7f52e43367c8b258"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/attachment-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08c19083e3f80c3acb7b8cd95003c1d43546e5da43a6379b44dc6b5090e2b03"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"210914b8a8c94a670f104f03bec4c1850178501ac114e5dab5d2815c46966146"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/ActorStateAdapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6a08f9ecb9a48efab41f232aaf2136af7bffdf42f55ba92d65aa934985d3d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/devtools/src/mod.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"845338a3d98a1a137173dfe1ec63223a37bcc90b3b1ec8eb5a3437275b865942"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/scripts/stage-inspector-bundle.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"799b1bd02cc2fa74d82193008a6926748d174675de8c9b17426d91d6d74abc2a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/react/src/mod.typecheck.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a636b6cae1e1851208819b762b2b112142495b6abbeb26dd2a42794981df386"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/cli/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77154c267dd3fe0e4ef5bc1aaca50bb4da6a9a659a920c82c8f5e262596eee0c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/serverless.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec6b9598822cec32378dd8e1912c292e6074335e6c95bce84663ac1b4068028"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/scripts/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af202b1b94d5e5e5047186a1e28963096e228862c20e1e1d3a30c796ad2366c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/dynamic/isolate-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0e63abdea176d724d62f60ce692a42339c15cbf08b3d51b3d16480e0ad9fa8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-websocket.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b51ce675acfc667145577bb0c22b69a4408e07449d6b289c6aec6cb8a352895"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/inspector/workflow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aee2b01349240307dde7341a4a4d8df67f7a80fa3cf114ed76d79827245ba44"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/RivetLogger.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d716cb447294943ee1bc294ab2ef2c8fa7fcb0d0373d6fe7fcfa8ccc441a695"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/run-store-composite.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6009ec273d1d6aff18eb7ee6d3c105742e483e38f3f44c11b2ae01a0113e62b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/check-wait-for-comments.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b8c39528e52e63929615860b52a1bf6b0432fda10af5b8a8e9c070237349ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/check-annotated-skips.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0399bdf50b2e73a8dc64a7e0e6b94701933b096ee2186d3dc83be1986dbfa811"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/cors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eea9f5ec297a130baa5e8d1ec65abccf3371d75144c09352e8eae1f7e2cfa7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7f03c835743dc83d0a69c806b46c8e7945dbd73b9b168dcca02b2412b1d31e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/dynamic/internal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56461f738eff981b8300843596d99fc2f9fba7fc62cc1b45a43f19d13be9f11c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/drizzle-compat-smoke.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5067e51f2c044f1dc97a78c9080a4df25df0b5a9c3083acd3bd3457b4599bf4d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/eventsource.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b4d3e5acca7f4b7312098c51cc192ac81f821bbb5194dbc2afc12179b32622"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/tracing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e424d0745e88394407559868f4581ca5f5c8a39a709c39e1ebae7ca225fbde0a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/crypto.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6695b9207e2309afa202cb695768d84d4b72abd639605c33de6f276fec20451"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/check-built-commonjs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97d1a063ba4b3974e36b17fff2fe06009752d3b11c065fd1d3111d2d4ef6176"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/actor-config-schema-gen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eca7153a2f83c5d1934b331c10cd2b976786b714bbd23c1f01ca05f8c483613"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/registry-config-schema-gen.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6341a03e2977df35f77e724bd6eaddb1d38b36dbf4eb832fff07b0fb4b86c5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-wasm/scripts/check-package.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaaca6b1d9ee5beb4ce20998850e3858d5fc1cbc6e13a767535af01a56c9b0b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/dynamic/instance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d9f4a1de23d579d16b5cac2205a6917d38ca609815a103f703394b3225f1fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/dynamic/mod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821a8b4da9b2295f368efcc0b96fa2a8baecd507fd05c00ef1adb803f17574b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/scripts/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8084ae4e9d1c89bd5defae62da9db00127abf4a36c223a9590a97ee28e588a85"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/codec.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84831209444eefc5bce242a6286e17fb879c412319c2fe9da40bd32495c82c6e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/inspector-transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7851310f342dfff325a0b92cb098c88931022e40eb51c2cac49f012d5e736bc9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06ef3144fa433638b2afa3012779bcf6b1551aefbbfe1231f2b5f515076e102"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/log-levels.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d26160dc10b776105f7455b70e8f4b2d32e139b552e075e28812e349b5ebe1e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/devtools-loader/serve-devtools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd037d6eff1f7bf653a78389fefcda141fa759b5b52e3bbfbaed47992f1e228"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docker/compute-hello-world/server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea7891a4319627fd5fd8f2f1bac7afc0f898c40d076624e101de98e527b2e42"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/conversation-stream-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"318154cbdb86f4736d69c420862ca2c23721b9c7bf1ca4d8303df2de24ad7279"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/router-request.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd613bd95d54c8e1d1164d3f59f12d6f4bae1ad33db5f4f963516e79c4c8863"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/schema-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b87d4cc9b833d352a5e53f0a6229cc90e03786df01f52819b9cf695d7e6130a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/async-db.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"393674cbf913a9d8b6f7ffe7ca4abc6d8ddcdb0652bd68e5157b5326fd48fca6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/ActionErrorEnvelope.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b659f626d8526af3f0a0c388748e6577e69d305d1c368042cea086c09dee15"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/pack-devtools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3665fb34a7e436a3941588fe1b40c78f111c21ac33d607b59b33edbabf7355f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b540f83296301840e2137ac43267c606965a376160433eeda5c7400a7b91ba"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/encoding.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"652010b2a6fac31bc905df65ce3f3a1c11a4fae1255134b2425a50994f16d137"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/registry-ops-async.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb633989063750e57f79d6407ed7f525b03210a9f017455f3ddac0e9f78632b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/envoy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c78dcfc29b810cd0e3331d66aaef8d347391a34e75a93c3d912bab76330f55d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/sql-loader/src/hook.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50984d2ce3fb02a4edce12c32c4e9987e506f3592e6d27fd3dfb432bc4f4e0f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/scripts/actor-context-smoke.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b695705ef6449e2b3d401cd2033d745b096171295ae203e6489c52b6fdf66a0e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/index.browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"950124ff28edfefbd87d97236fb471668b79b74ae2702bfc5419d7fd5d36a220"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9da2ca530a7a51b2cb2c035b4b4733da9506286dd112f2520d33948b3f2c56"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/effect/src/internal/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58497ca8d090aecd6484279564bb02bc8de736ce9bf25e74ea35d43f521812e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/helpers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e39d369ecf9d7534218347b66664332c8de27b3500033d40c9869584bd9315"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/log.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea41292721d90abacd50a21a8c6eba76d780eacb6e0895dd1d02c41f6942f3f6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/agent-os/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ccaf0068a2d6a6f4bd457db1c2db30af3c040f3b1e08329d11a402b2cefc4b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/log.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec8815dfc87f16ef012da45b2d59ff1cecc1d138af73866d4950ad245f4cb5e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/sql-loader/src/register-require.cts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d5150adb4d1267d06c29bd9d8e47c2cab51db6c46e99673f3bceea3c0cad9d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-api/common.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6d932a8b1f7353d8f3afbabf76c81ce102d1391270806c234bb80fb92e825a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/sql-loader/src/register.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e35208e7880290988155e6d72f85c982f0b0478d57e138680b9d57dd52b347"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/network.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e93bc035409f33731327d29a0bb8fe7dccb8eef24b2dfe3b9190226b275a55"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/workflow/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"248070d18b402dd48713a637d48966469150f4523df6c8ec9f8f6817952ca595"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~407 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v4.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a552b7eb096887dfabb60cdc2e495db6d5e1f0e528d6707e19d4ff91736943d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~320 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dc3e34b153231ab751d18c30214fe3d5875db2b78b017cf196963e016d9e4b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~284 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts, rivetkit-typescript/packages/rivetkit/src/common/actor-persist.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v3.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22caca3cd022169092afe7a770581c551a59987f741b6884ae1275dfc03287f0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~267 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/bare/actor-persist/v1.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62caab4682fb14dfa9c1b4f7987d846820bf82102ae7dbe5943311dbc633f74c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~217 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-persist-versioned.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97a339d418a75199a81d5669bd4cd02815344f32a45bf73d6aa45e3484a7472"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~164 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/runtime/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d042b2aa5209ca7d7addc458377f6f67d678c8533170f0e13b4139a0d95162be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~158 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e060f8f7f7df1ee9335fc92e6ae9d0539ee984ba3eee3feb2bd5f2fd0d9b1361"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~117 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/hibernatable-websocket-ack-state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fac14b03f524c709b82535699c11fe4eabf486dfb925098fbe02ddc4c587f0f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~83 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/router.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f29ee9852417ca3da89d095187d5c565aa10c08955fb9e1e4bb6175be94641"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~75 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/react/src/mod.typecheck.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0986d425b6811b6fbc5e9efe4c7becd1b33226f3ce59b33b4e641d90a0eb05e2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (rivetkit-typescript/packages/rivetkit/src/dynamic/instance.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/dynamic/isolate-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3544fd3a7d65f2d4832233eca2e3e0df04399a61e073f4c95dbb7021b4254b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~57 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (rivetkit-typescript/packages/rivetkit/src/utils/router.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/cors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07afe390bc5ba73e9c53f3006e376cbf2c38eecb76346ef311815dbd3b3ced1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~47 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/drizzle-compat-smoke.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2bf240fe60f4a71a73331fe69cc1479064d128c61766b0c49a0bcf78a51d9e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/eventsource.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c15c1f106fa349226f94a51fec02c34fcee143391c2bcdcae693ad4cabf5f0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/dynamic/instance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec1d9da468f1236af6e2233c74f56cd683a0b473e4a793d11b968d203b71be7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/log-levels.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"900d7a1cd31bad8ec445c998084de373dbc94c12e0b88d6005111f1bba3e143a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/devtools-loader/serve-devtools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb851ebb5ecee3f708524e884bfbe2a1cd2c5a734883767ed7874dffc251383"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docker/compute-hello-world/server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94659485fea904230baf68a46d8ba067bc503cb2853cdca4acc1b85139b13ba1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/pack-devtools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6870e46339e632b2c2625380ea1cca50ac1f2e306cbc7e9552be9a9a00b7aad"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/scripts/actor-context-smoke.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b99f86626614baa574553bd851b036a8cb032e3122a6e9cea354387fd1b1e49"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/network.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03db5afdc8f13c43681664cf214946e64ddffd512fe7e095baeb8f10fcf571b9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-persist.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b633b8f960f0665e41a733a2aa6d3d3619daffb45adad5047765f877bb47cd54"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (64 application, 25 tooling, 2 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/workflow-transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b1fd4b49b15605e46b33e389d531e6b8e93c36a955c26b668ea5157d735106"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027queryOne\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/flue-runtime/src/stores/async-db.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b43c1ddeb9dc56de52f3199eb93779d88cb584063ea80831daad284fb1357a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isStaticActorInstance\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/definition.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68aa4a91b37d016fc91dc6943ca5daf50bde0aeb5db74448907f77b2955f466"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isStaticActorDefinition\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/definition.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c065ef4a694547292566180fb40f5fd7657b851487d6eee2d02ccae4108bd0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027lookupInRegistry\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/definition.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b371c09d05c75e2d20d1095e8c95036fce4d4b7117f380c6b460e668c5d35a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027actorKeyFromGatewayQuery\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"596dfd9698ab3af399b2eb4b3470548367391309f9a09f19da245d1ad212670a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027makeTracesKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a781592c9ffc5fe7f5aae2c786baf9e544ae07ec2798a5be0c15df7e3140f114"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027tracesStoragePrefix\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3578d9fbd7e4c4a0cff004a310209f87dff0a95680b4b6bd510daa7c6d978407"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027queueStoragePrefix\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6da257427627b436e2ebbde745893cc3a2533bebb0a64de5da39974940a11e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027queueMetadataKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6535e645dac09d3459acd810bd82fe0d04a77b211679850cb41c2c345432ef2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027queueMessagesPrefix\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ceef839efd394a3affe31c7c82e9cf5ba923f6f68766a328799755d876e9d4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027makeConnKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"248836c90fd5914125387b48be05fbd660218da624135a742a05f95fd8729dc8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027makeQueueMessageKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f2c5b52776ed09f01f0afd4db2325b92ee08b40e39bc966264a459c2233370"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027decodeQueueMessageKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/keys.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"974a6d540f150d903f9993ef7990825bf4bcacacfe4a5cf33e43ca7f55e820bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027event\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef32e3e2927b4427bbe32a10d2dddf68dfd10a251a02970eeccdcb80c6ed3f85"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027queue\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b225d0273729b76d50cd7caa47ce791c9f1cc0989861b91828ffda79b09f9fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SchemaConfig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"031a1d83998d40d3f12b667f5ddff4b40e3f396e279db1f166084f91a03ee179"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027validateSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/schema.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3320c13c617f7a79e0c0cff0c538f4659ba41ecdffe91824ab9f2cbb6f43ad77"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ManagerError\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/client/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/client/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/errors.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"939662a67178fb6c46171309cddd7446a2a8f0c1c9b2838f0ec28436a90896b4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MalformedResponseMessage\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/client/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/client/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/errors.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"91709bf9f12433bd7947fc1d6f9d0844957b38ba3a600a685ec6f9d535cfb35f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConnectWebSocketRequestSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/query.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d65dc450c4022256c20b5a4d36288610d673597f5ad91c938ba3ad2c5a0b8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConnMessageRequestSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/query.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6652724f621da0336cea22d3df615d273094afcb3848dcac13d15acfea1453f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ResolveRequestSchema\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/query.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf10b30045381e6917575330adc6e8bf8d9943d2a8616dbaf1d3e8ccd62c54f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GetForKeyRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/query.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa713740bca6c83b2c616d783d56d5a8939ad253dc21037b90b2d75c0cee464"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GetOrCreateRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/query.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e5f548d49b67a968311798feb7c18aa9fa9159f79fdb7343340c3035cda265"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ConnectQuery\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/query.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5498f6585d750ab770547f9c1c182a0ef61a2e4649dc2cd2e83112d0bd37a9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WS_TEST_PROTOCOL_PATH\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-router-consts.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8d812b9b8e64789fd1a0803b2a216a091f8ba7f5ade515bdc1f1a0b07650da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ALLOWED_PUBLIC_HEADERS\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/actor/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-router-consts.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"45df29df2b9bd4b31d3c4c116cd717603a3d9ced0e15b7d21bf5471dbf630efa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseWebSocketProtocols\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-websocket.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dda91b0d2c6cd18e26549f05588a369b86bd36dd688d4ee6d063d52790d9c83"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027truncateRawWebSocketPathPrefix\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/actor-websocket.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3bc96d6aa8e91e5422e6227a16aa2c2338159ab5b48d6259730d302f5ce49e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HTTP_RESOLVE_RESPONSE_VERSIONED\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-versioned.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"004abbfb41703e5c327fc052c998662bccfbe914f779d8172b54945a5f45f7c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ToClientBody\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-zod.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c8c669824abb9fe84e5a48feb15efd9f4c0d445212e52a40d44beeb381574a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ToServerBody\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-zod.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b809ac25be736d4c2d2b622058701b23d8427a38c38675c7ba4a4aada6a6b1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HttpResolveRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-zod.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a63f06e717e81556a034ec691d57c1a4a1dc94da13369cd1aa7b30e86bb15e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HttpResolveResponse\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/client-protocol-zod.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0ec8f98c8e57f0edfeba70129a26bd66a93b3af55c5ed26dd6f9b82958c7f5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isSqliteBindingArray\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/database/shared.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b7716ad5052f205120d3c7080d2b4d0d43e298b32a6de2633bc478f94a2545"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CachedSerializer\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30c02b8a4ca864954bbafd9cc0c3529f08c04abf2899cb489823caec27c2377"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027encodeDataToString\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7ff48d72268832c4f118e03bcd5af7c0a3c213df83338858d61d0a53550f75"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ENGINE_ENDPOINT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/engine.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bcf6fa95bb92e6f917f8bc226768b4e0419d86c3c30bdc6d7d8aaee381de98"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createInlineWebSocket\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/inline-websocket-adapter.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8bd6aaf79c8eeb30c2de0c8118b854ded75d78422cc8507c3efbd618d19dc4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027handleMetadataRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/router.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"367b6fb3c0e97b01e3efc303fc1f70f2bde5289c143d071123f1cdb6646c6982"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027handleHealthRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/router.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0737c72cf25c07503590c7fc015a1161015ae1b190531ebde2155f796df77cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027safeStringify\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/utils.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"698352f1dd153706b26615554d6fb2b0467a33a37aa77c4c26a147f9d112176c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027setIndexedWebSocketTestSender\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb71fae783a0cbba7cb3f1a01db16c3649ad18627018f19b35c61585be9e132"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getIndexedWebSocketTestSender\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4192df8beade68e87ee99d213b01a0fe03b36e5db5572efb1b240a9e73c4f106"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getHibernatableWebSocketAckState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c762f0162846d51fbfe660b0c49af4129fc6c8c0d9cfe34958f92df785c80a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027registerRemoteHibernatableWebSocketAckHooks\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e5534a95ccdb31e8d43239ff5b94db41aa14e9e4ebb4ef4682f90c3971efcd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027unregisterRemoteHibernatableWebSocketAckHooks\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dcfff7592e036918987741534be41133e320c1b32f63514777036668c77a9e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027waitForHibernatableWebSocketAck\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd6f1ab960fa41eec65154dc418d54a7b1f0558a1b61511bcca470a80649471"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseHibernatableWebSocketAckStateTestRequest\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f524d34d060f56f90f6e090db8f571fb2334b659c10b2ecd3997ae19009634"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildHibernatableWebSocketAckStateTestResponse\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/websocket-test-hooks.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"167d520c07944df6d0a5edc26292360cdec39a7f20d7bca44637c1c74ca988d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isDynamicActorDefinition\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/dynamic/internal.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3c40047bb0cb8091fda71c06e9223538527842107e380437477018d54f29f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ActorsListNamesResponse\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-api/actors.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cfa366985493cbbff91b842a92d97d07e009c90a45e0942cb3e46edc9cd4b9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ActorsKvGetResponse\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-api/actors.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e15f1455799a32cf54d59fcee5fafcb3e1d4342fbcc00b71abf4ba2ae0c995"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RunnerConfigsResponse\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/api-endpoints.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7178ec143b3c1c5c3b48e17ec92cc7eec5753a3188ad661f6df073ef5b92f7e9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027kvGet\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/api-endpoints.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5f938795d0eb7710227b919f3812eff776d5d804930833d4a760d8f384e29f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getPool\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/api-endpoints.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f460fd991a955ebd85f8a7eca127dd6bfde7153b7462a0e6c36311e247d1017f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027listPools\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/api-endpoints.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d765afda3169c5b69445e907f6f8d9d3d123717d02fdbf9f01eaa3d96897caa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027deletePool\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/engine-client/api-endpoints.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"418af8de070d0e28ec843698c1a8c166770b99c67c4b04d8cb62395c21aaaf99"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EnvoyConfigInput\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/envoy.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae6d95edbf7cfcaad1066c279c1241fb1d0d8c0a58a9b8d955e207fa32ca552"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EnvoyConfig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/envoy.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d053eb6783ebf2768cccd8f69351a32e39b14676492b0d2254f8cf1b4b92de6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TestConfig\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa37f35fb340ea6981b43a25106520217b3aa1365257ffd948d744fc7b6317ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SqliteConfig\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/index.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7b28eecbe1ffe4f0804e8e85ff67d9d9f8ee9a4daa73c19d4eeb84b0ccd5bb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ServerlessConfigInput\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/serverless.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0346eeb4d2988f5732b17a4dfce22e5f1056bce5419399ed40bc9e27355573"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ServerlessConfig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/config/serverless.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcc16497ce798b72e49108bfcc83d48daf7de42daddf65779488c3bb289dd77"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027setup\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/rivetkit/src/mod.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/rivetkit/src/mod.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/index.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2958f6c272d62c92890fcfd70d82b58950be8466d4e52898de046a80a2238c3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027nativeHttpTestInternals\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native-http.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e400a0280f6ca09afc79648ae716bba2659d221469e1bbb6282a01821172aa1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildNativeRegistry\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":5839}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3275c5d3d962f1688d8f6bee3e75c5fcefa7529301671a50c600731dcebc59"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RuntimeQueueSendResult\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"925a093aa28c7d4c69b13a60916158c56b43dc878f7f80bae29e36d63528b039"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RuntimeBundle\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58e4a7c78aa2742154c258c902b2fef505e5f020158a86e6384e31454806fa9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildServeConfig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/runtime.ts"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4dfdec30f9ad08790a7d5cd7d898c0f8b8ab4a0c46d66ea35b03d88b2c5cd8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WasmInitInput\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea87ca973fe635883e7841b62887583f1cb125e8648565681fd9f125bfa92b5b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027encodingIsBinary\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/serde.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb55071313d1950ad98683ce4f6664447a05c417e9f31cc8a681ebb69b06dd3d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027decodeCborJsonCompat\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/serde.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"397c086ecd4b8a6abadadba91ff4cb48d943a51c800f02514c434b878615a29b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027wsBinaryTypeForEncoding\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/serde.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eed3584c4aab7c7ab8cb39d2caabd4ed8dbc472ef9b936abb9da676fd7e411"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027timingSafeEqual\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/crypto.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3cec3dc99270eb24fe1bc1f60c6d0e384200843bce189d669f16417fcce234"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getRivetEnvoyKind\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/env-vars.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"59df17ed9b99782d11c1830cb3c6d54c8b72f1b1aeb3997fa4a910ff25806773"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getRivetkitInspectorDisable\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/env-vars.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d331ad804a3293a582b08e4e25685d1ba6880af88685a26ed4fdd025254fbc9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getRivetkitStoragePath\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/env-vars.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8320595f6529700031c68904df4bb188fa0974929bf2cace42b10f71dfa74d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getRivetExperimentalOtel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/env-vars.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"80443acfe5fd14b8bd543918abc4270af6951831c72d041352311623b27d1e05"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getNodeCrypto\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/node.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"454ca63ee857ed006d65e6b2caf70c105e966c3419c74baa352b2496b870b8d6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getNodeOs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/node.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4104e71a6e16bde5e3da4f2d437a7185cb0b92207c0fe7aaa534467116326c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getNodeChildProcess\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/node.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b7d6558d4b92ce8225486f92212870122252ac52068c29a6ffb66595e09d4d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getNodeStream\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/utils/node.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10f61d40e1d53870fbac427c7ed47e61b3539a55b78d6285de9373010be3286"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createNoopTraces\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/traces/src/index.browser.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/traces/src/index.browser.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/noop.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b84715be3bfd57d37fa4900c5cb2ccb3c3b28d9b53297704166c4b63d314f4a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027anyValueFromCborBytes\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/traces/src/otlp-entry.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/traces/src/otlp-entry.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/otlp.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac8a281fdba72ea68282f5e228b2a03df81a4a8c55876248b59c2107b018084"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createTraces\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/traces/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/traces/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/traces.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"26161b950bc2e5c995c6ad01cdc6a39b541d30ad8123fd47410536439e831261"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WORKFLOW_METADATA_VERSIONED\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/schemas/versioned.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de2cb29ce1760b1b3035a88faa12151d213849184c2cd15d38e6dfe24b7eb12"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseHistoryKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/keys.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af0a28f072d11de783144379af833eff546e74393bc214383dd4fff7254a317"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parentLocation\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/workflow-engine/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/workflow-engine/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/location.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1faf1dcc10187be620b0de6a1ae4b736a0468b5771451a41b72ab652251982"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027locationsEqual\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/workflow-engine/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/workflow-engine/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/location.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"688cdc6971e4aebf4311d9fd20177b1a1a1992fa39f332dfc52b497122656b35"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getChildEntries\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/location.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ccae49d76de6192a26593fc2475c217b993f4457262c11c85067e7c8ac5cbe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_KV_BATCH_ENTRIES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1db233a13039c8214fd3dc1e138b248a1bf5541066887b1cc26ca4ac847ea53"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_CONCURRENT_DELETES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebaa70c9201c08c693dac12e0f7df4ee72ab100409cce961d1d3ff173fd6c5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027deleteEntriesWithPrefix\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/workflow-engine/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/workflow-engine/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f312117b5e26d5df6555321238ca93da4783b84aaeb51316ed9260e56c9072f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getEntry\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in rivetkit-typescript/packages/workflow-engine/src/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in rivetkit-typescript/packages/workflow-engine/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/storage.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfc7510b384e9481b74506ef0e8faf53f18484bc2ec36f64e7060d29bf5eae2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027safeJsonParse\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/workflow-engine/src/utils.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3a2ed3755062abf351c3358241a2f80530ba9a50060339ff3a99cc2661baf4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DOCKER_IMAGES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/docker.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82f9771bcabe06370d03e9669271325dbd7400fd6f89757cdf2a57dbfd7ba0b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027validateClean\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/git.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c046d3f3a1e37c6356a2234b48e523ca24f99a4e589a47b5980a70b37442f3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027encodeStreamCursor\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":"integrations/workflow-world/src/index.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f8631999de881cccfef47dfbc7cd2d763c02977fbb19b8e50890238a65d702"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_extractSchemas\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":"rivetkit-typescript/packages/rivetkit/scripts/dump-asyncapi.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"29648a25f9cb0217323c29c9e97601d9a380b989e969b70abbdc507e3aa4c0ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_assert\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":"rivetkit-typescript/packages/rivetkit/src/common/bare/transport/v1.ts"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"208e95b4395867afcc6d81a5c074014adccc1411415e550212c3a072bd20010a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_MAX_CHUNK_ID\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":"rivetkit-typescript/packages/traces/src/traces.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fc9ffed3dfa55c904f7d3c5655b635653cdf472d8450d3edc0fadfb083a429"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_assertNumber\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":"rivetkit-typescript/packages/workflow-engine/schemas/serde.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6dbc87a18b5d09ad9d86d2e0ba0666f06ce4d76f3893ffb0ad7d21e6423290"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@iarna/toml\u0027: Declared in the root 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":"package.json"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6289cbf8d30cdc5592e019f634f6f14795cff26b4d81f9e938dfb2b118a109"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@sentry/vite-plugin\u0027: Declared in the root 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":"package.json"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ca9934c5105f2fcf2b8d298d02f7530839698cfcf63092fd93cde37c46d14a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027fast-glob\u0027: Declared in the root 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":"package.json"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61d1929d56d2917e5df2c2dea29c166902d07f5bb7479ce46ebe925dd3fdb99"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027handlebars\u0027: Declared in the root 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":"package.json"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b27de92dcd0e88bc5979f4b593c33610beea9498fbfbdd7555be9193e759127"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027lefthook\u0027: Declared in the root 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":"package.json"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce421805cafdcdff1f97b1a9972b70e3f4432bdbab53245a044d76cb635522ed"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027zx\u0027: Declared in the root 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":"package.json"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0552bae3977cd21defcbc1d997323a27fb3ec1b333743a94a14ff485375d3fb"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027motion\u0027: Declared in rivetkit-typescript/packages/devtools/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":"rivetkit-typescript/packages/devtools/package.json"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3174a083b49a4a0c1c6162d03f60370439f5de31b8cfc1864f6d71f207f25d9"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@arethetypeswrong/cli\u0027: Declared in rivetkit-typescript/packages/effect/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":"rivetkit-typescript/packages/effect/package.json"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5106c9f8b2670fc7c49b1b24d76d510b866cd5044a5f47154176487e4af746f"}},{"ruleId":"R8","level":"note","message":{"text":"Type-only dependency \u0027@rivetkit/engine-api-full\u0027 in production deps: Every import is type-only \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/auth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36343c501d95f04effdaa9e50c2ed03bb3f415e929f8d863bb83b583bbe6fdb"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts \u2192 rivetkit-typescript/packages/rivetkit/src/client/client.ts \u2192 rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ed65618c9fe121771d59ff9dfca544996f66367a6984ee2dad7cfb0e113874"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (4 files): rivetkit-typescript/packages/rivetkit/src/common/encoding.ts \u2192 rivetkit-typescript/packages/rivetkit/src/common/utils.ts \u2192 rivetkit-typescript/packages/rivetkit/src/utils/env-vars.ts \u2192 rivetkit-typescript/packages/rivetkit/src/utils.ts \u2192 rivetkit-typescript/packages/rivetkit/src/common/encoding.ts (one verified cycle inside a mutually-dependent group of 6 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff46f2605ba2b239759595e11a449e85059dd8ad3f098325378054112b5ae62"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/commands/deploy/cluster.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7377977833ac8fc8a17741ac2ed7a82b7ade6e55b06cc8b7b7277ac69fd0b17c"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is configured \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060vercel.json\u0060 configures this repository\u0027s static hosting, including its response headers, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/native-websockets/vercel.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5e0514c477df4fd01e3681344dfcb120e4ab8c68e1873076b6dae152b950e4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/multiplayer-game/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/multiplayer-game/package.json"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43288d7480c09d9f43490a437874b96b9311476c1951ecf822b5ad70f77d9ab"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: examples/sandbox/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/sandbox/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d82f9dfc2de6a571bc785ec763cb7cf4abf09e2acfe38d89e8a0e195ef29f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isDynamicActorQuery(this.#actorResolutionState) || !isStaleResolvedActorError(group, code)\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts, rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0152691bf0afaf569ca22314d735302496415de421686ab02cd1ee329db8efc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060RUNTIME.type === \u0022node\u0022 \u0026\u0026 RUNTIME.parsedVersion != null \u0026\u0026 RUNTIME.parsedVersion \u003E= 18\u0060 appears character-identically in 2 files \u2014 engine/sdks/typescript/api-full/src/core/fetcher/getFetchFn.ts, engine/sdks/typescript/api-full/src/core/fetcher/stream-wrappers/chooseStreamWrapper.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/typescript/api-full/src/core/fetcher/getFetchFn.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f428b274a5caf797f495c3b900dfb0e531451960334aff0b5c46aea8b8da3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body.args !== undefined \u0026\u0026 body.properties !== undefined\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit/src/inspector-tab/mod.ts, rivetkit-typescript/packages/rivetkit/src/registry/native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/inspector-tab/mod.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6a988cbf5788e1c704be5bd94049e6ededf30decb7bd2ea320350dd7a23338"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.vars.wakeArmedAt != null \u0026\u0026 c.vars.wakeArmedAt \u003C= target\u0060 appears character-identically in 2 files \u2014 integrations/workflow-world/src/actors/dispatcher.ts, integrations/workflow-world/src/actors/workflow-run.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/actors/dispatcher.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e22143214346e68196600cfc0635d1093aeb4a62ff1d9d67c664e17e2dd532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isFile() \u0026\u0026 /\\.(ts|tsx|mts|cts)$/.test(entry.name)\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit/scripts/check-annotated-skips.ts, rivetkit-typescript/packages/rivetkit/scripts/check-wait-for-comments.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/scripts/check-annotated-skips.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e36444160317c8ae1b43bbd405b3ec2d70f774e9623d50b89d53ce0224618cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0022win32\u0022 \u0026\u0026 process.arch === \u0022x64\u0022\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/cli/index.js, rivetkit-typescript/packages/engine-cli/index.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/cli/index.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41d89b68ab0701d9d2e794566bd1d32bee3be553dad12b2e319212edcb55cd1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proto === Object.prototype || proto === null\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit/src/common/encoding.ts, rivetkit-typescript/packages/rivetkit/src/registry/write-through-proxy.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b753c2a49ef6ce7e7d09a7be329a6cc7468e3115f5b144d104054074d78e1fe3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prototype === Object.prototype || prototype === null\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit/src/actor/actions.ts, rivetkit-typescript/packages/rivetkit/src/actor/config.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/actions.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d786d6de474c18e8182f4df8b761b9eed29f671e2dc307897596c934dfda81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof error === \u0022object\u0022 \u0026\u0026 error !== null \u0026\u0026 \u0022reason\u0022 in error \u0026\u0026 typeof error.reason === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit/src/registry/native.ts, rivetkit-typescript/packages/rivetkit/src/registry/wasm-runtime.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/registry/native.ts"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"020e54122429c2cf36f409e60d94b2efb2e65795d150b51b0fca7ce7fcd5f8cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof opts === \u0022string\u0022 || typeof opts !== \u0022object\u0022 || opts === null || !(\u0022name\u0022 in opts)\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts, rivetkit-typescript/packages/rivetkit/src/client/actor-handle.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/client/actor-conn.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed7d8bff099b39427f6f032f14d8a755c0715149c505e655df9e579ee846928"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022object\u0022 || value === null\u0060 appears character-identically in 2 files \u2014 engine/sdks/typescript/api-full/src/core/schemas/utils/isPlainObject.ts, rivetkit-typescript/packages/workflow-engine/schemas/serde.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/typescript/api-full/src/core/schemas/utils/isPlainObject.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"456b2e178774739467a8adefd9bc37af4856362c83f3bbcd1cf64063b43363d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022object\u0022 || value === null || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit/src/actor/actions.ts, rivetkit-typescript/packages/rivetkit/src/actor/config.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/actor/actions.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc3f431fe5606a9876698ab6c74ea51912610549d5718bcb7f63e987523c960"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === undefined || typeof value === \u0022function\u0022\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/traces/src/read-range.ts, rivetkit-typescript/packages/traces/src/traces.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/read-range.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"564378066c63cc288d97a948888a90e99d8afddcc062e806950477de779232f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!authority.permits() || message.is_request_expired()\u0060 appears character-identically in 2 files \u2014 engine/packages/auth-jwt/src/rotation.rs, engine/packages/pegboard-v2-migrator/src/requests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/rotation.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c7336ac2ce2906adb8ef05ec76ea93c70d20382e49281a68147626a9b6b26b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!proving \u0026\u0026 fx.now_boot_ms() \u003C pending.deadline_boot_ms\u0060 appears character-identically in 2 files \u2014 engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs, engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"615f64e2884f9e805565c22c48497ecdadef879823c209171e3dea18a444b7d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!timeout_ms.is_finite() || timeout_ms \u003C= 0.0\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit-napi/src/database.rs, rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/database.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc330a3c26697051de5092f9a1b9a5562a30f726dd03d65b3bc6fa3e46b33e04"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060authority.permits() \u0026\u0026 !message.is_request_expired()\u0060 appears character-identically in 2 files \u2014 engine/packages/auth-jwt/src/rotation.rs, engine/packages/pegboard-v2-migrator/src/requests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/rotation.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7c6735a5ffbee78c70dda04fa42cf6baaadadb518f3ada70ca835fc1cee106"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060authority.tenure().owner.worker_id == *pubsub.worker_id() \u0026\u0026 authority.tenure().owner.instance_id.as_bytes() == pubsub.instance_id().as_byte\u2026\u0060 appears character-identically in 2 files \u2014 engine/packages/auth-jwt/src/rotation.rs, engine/packages/pegboard-v2-migrator/src/requests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/rotation.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"487e05c306a3312766927e3729aa15a376ae6ebac29e91d10e65ffa222282811"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060capacities.incoming \u003E 0 \u0026\u0026 capacities.outgoing \u003E 0\u0060 appears character-identically in 3 files \u2014 engine/packages/depot-client/src/volume_requests.rs, engine/packages/depot-volume/src/ups.rs, engine/packages/depot-worker/src/coordinator_requests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/volume_requests.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb5556095d0c6d7208afe85167e1c4ca28e9965f1c6e44730ce98ca68d44802"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context.public_ != Some(true) || context.status_code.is_none() || context.status_code == Some(500)\u0060 appears character-identically in 2 files \u2014 rivetkit-typescript/packages/rivetkit-napi/src/lib.rs, rivetkit-typescript/packages/rivetkit-wasm/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit-napi/src/lib.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"33579732cee21ec687140c404ac65e339bb3c7a7e7dd414b6539088de7cae624"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.group() != \u0022depot\u0022 || error.code() != \u0022overloaded\u0022\u0060 appears character-identically in 2 files \u2014 engine/packages/depot-client/src/client_protocol.rs, engine/packages/depot-client/src/command.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/client_protocol.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4141da617e0302e5af2ccc2adbb615ac759e77cb0f782c44d746847ed80c1887"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inode.kind == FsKind::File \u0026\u0026 inode.inline.is_none()\u0060 appears character-identically in 2 files \u2014 engine/packages/depot-client/src/filesystem/cache.rs, engine/packages/depot-fs-core/src/forks.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4f43f728f84f48a883bc274c9cfd14bf715658b0135214fb93bfe3a7ee48b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060max_bytes \u003E 0 \u0026\u0026 max_bytes \u003C= CHUNK_BYTES\u0060 appears character-identically in 2 files \u2014 engine/packages/depot-worker/src/filesystem/base.rs, engine/packages/depot-worker/src/tablet_maintainer_machine/state/materialize.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/base.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c53bce98b0734f7f7eec7b26cf824fcb9d1cc318920378abd50da183c2f5ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.message_id.gateway_id == identity.gateway_id \u0026\u0026 message.message_id.request_id == identity.request_id\u0060 appears character-identically in 2 files \u2014 engine/packages/pegboard-gateway/src/http_tunnel.rs, engine/packages/pegboard-gateway/src/websocket_tunnel.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-gateway/src/http_tunnel.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"375fa52a77ad53622f9c24b1abc41877cb793bcaa40e9798bc18ccfa3f195a34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous.volume_seq.checked_add(1) != Some(entry.volume_seq) || entry.client_epoch \u003C previous.client_epoch\u0060 appears character-identically in 2 files \u2014 engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs, engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"253bc5b2bfeee2b5f573e387d9debc9cfaa68a0d3a1f59e9e942092cc538c386"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060refused_tablets.is_empty() \u0026\u0026 unknown_tablets.is_empty()\u0060 appears character-identically in 2 files \u2014 engine/packages/depot-log/src/log_shard_machine/state/status_notices.rs, engine/packages/depot-log/src/log_shard_machine/types.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/status_notices.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0539bb5c93d5957f2dd5224879c9773940e266a85640358dac41627937024f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.record.is_none() \u0026\u0026 response.commit_lag \u003E 0\u0060 appears character-identically in 2 files \u2014 engine/packages/depot-client/src/groups.rs, engine/packages/depot-worker/src/tablet_maintainer_machine/state/groups.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/groups.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd6ce8a03bd474bf59e86277f96d9cc41284e8fa414ba99d870258e600e690f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060volume.applied.volume_seq \u003E volume.record.cold.volume_seq || !volume.record_persisted\u0060 appears character-identically in 2 files \u2014 engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs, engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":3113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d08275f48309962fe13655b1f0722d1f5d7af5f4c3b0d5815397364415d9133"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060if opts.ephemeral == false { self.msg_queue.lock().await.push(msg.clone()); }\u0060 follows \u0060\u0027send_immediately : { let Some(driver) = guard.deref() else { break \u0027send_imm\u2026\u0060 (line 389) 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":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b27ec67fe8a08120ef4d3ae8e2db68062175a7d31fcd498ca9f440a029cc39"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060# [ allow(unreachable_code) ] anyhow::Ok(())\u0060 follows \u0060loop { interval.tick().await ?; ping.send_replace(clock.observe() ?.unix_ms); }\u0060 (line 1807) 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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3b20feb646b64dcafaae09f10e2e2372c8266f584c5595802bfb293c86c5a8"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060# [ allow(unreachable_code) ] anyhow::Ok(())\u0060 follows \u0060loop { interval.tick().await ?; renew().await ?; }\u0060 (line 1816) 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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d929b0bc77c4275dc2c9f509e55f9134ef4dc7d5c6ca9ad59ac06b266c8cb6"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060# [ allow(unreachable_code) ] anyhow::Ok(())\u0060 follows \u0060loop { interval.tick().await ?; refresh().await ?; }\u0060 (line 1825) 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":"engine/packages/pegboard-envoy/src/connection.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f8b60e6af47ca45e352d79f03184a37829a0614dc641b9455e71dcd70bb814"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060if state.operations.index().promotion_lists.contains_key(\u0026 worker) { continue; }\u0060 follows \u0060{ continue; }\u0060 (line 90) 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/promotion.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"107ca7f850268b5d138325d7414f9155285be6d5e97d3826577cbdb22e30d3ac"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060anyValueFromJs\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 145 (\u0060anyValueFromJs\u0060) with a piece of \u0060value\u0060 (and at line 153, line 160) \u2014 and nowhere in \u0060anyValueFromJs\u0060 is there a depth parameter, a descent counter, or any other cap. 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. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060anyValueFromJs\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/traces/src/otlp.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"457974699c4305b263682655640dacac5bcaf834f05d2e0b4d9da7f7e345bfd4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060assertJsonCompatValue\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 141 (\u0060assertJsonCompatValue\u0060) with a piece of \u0060value\u0060 (and at line 142, line 150, line 158, line 165) \u2014 and nowhere in \u0060assertJsonCompatValue\u0060 is there a depth parameter, a descent counter, or any other cap. 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. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060assertJsonCompatValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c89f142a0fe0bce072252176dba82ae06423f7f69e12c95e159ade2dc3a5fb6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060encodeJsonCompatValue\u0060 is exported and takes \u0060input: JsonCompatValue\u0060 from its caller, and it calls itself at line 324 (\u0060encodeJsonCompatValue\u0060) with a piece of \u0060input\u0060 (and at line 334, line 335, line 344, line 360) \u2014 and nowhere in \u0060encodeJsonCompatValue\u0060 is there a depth parameter, a descent counter, or any other cap. 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. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060encodeJsonCompatValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bccecb98add40f3eab53dce27ec445dda8c95c7cab71291897c9f0561af0ba6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reviveJsonCompatValue\u0060 is exported and takes \u0060input: any\u0060 from its caller, and it calls itself at line 395 (\u0060reviveJsonCompatValue\u0060) with a piece of \u0060input\u0060 (and at line 396, line 421, line 428, line 435, line 440) \u2014 and nowhere in \u0060reviveJsonCompatValue\u0060 is there a depth parameter, a descent counter, or any other cap. 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. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060reviveJsonCompatValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/encoding.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a014fcd724f03ca3887b4e35238a9bfc90aa660aa1fef2a16c598652e5541b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060disconnect_transport_only\u0060 is public and takes a \u0060ActorContext\u0060 as its receiver from its caller, and it calls itself at line 968 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 \u0060disconnect_transport_only\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/connection.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d8af31c4550c7f76765a970f4797ddee810e376a515cd00cb679b2ddf54d43"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060with_application_span\u0060 is public and takes a \u0060ActorContext\u0060 as its receiver from its caller, and it calls itself at line 304 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060with_application_span\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d1fc24823baea2abe84bd78587240d31292d989356d9f959d6560d9826cad6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060record_connections_updated\u0060 is public and takes a \u0060ActorContext\u0060 as its receiver from its caller, and it calls itself at line 1816 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 \u0060record_connections_updated\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffcb126eaa18d217de8a1e2e5af0a16b58413b9c57b4ae69396109ccfead277"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060record_state_updated\u0060 is public and takes a \u0060ActorContext\u0060 as its receiver from its caller, and it calls itself at line 1807 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 \u0060record_state_updated\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e405759e9b95f29e36d7ba99f4938ee40291253eae1c6b94085afead4b9987"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060record_schedules_updated\u0060 is public and takes a \u0060ActorContext\u0060 as its receiver from its caller, and it calls itself at line 1827 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 \u0060record_schedules_updated\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b0c861fd96c01ab125d7680f9ac5fd825044706f223b80e068b816997372a0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060into_body\u0060 is public and takes a \u0060Request\u0060 as its receiver from its caller, and it calls itself at line 139 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 \u0060into_body\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/messages.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d77dd3be8eb5289c42ca9de8c34f6681a0b17d64a008a1bd7c2dbfee11fdb9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060active_http_request_count\u0060 is public and takes a \u0060ActorContext\u0060 as its receiver from its caller, and it recurses at line 791 through \u0060observe_http_request_counter\u0060, \u0060http_request_counter\u0060, \u0060lookup_http_request_counter\u0060 and back with a piece of the document (and at line 805, line 817, line 825, line 846) \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_http_request_count\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sleep.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"814fb9ddeb0ea5d79f8f5c3c69925dc54317c0ce735699eff36b05f92a1e3592"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060cbor_to_json\u0060 is public and takes \u0060value: Value\u0060 from its caller, and it calls itself at line 71 with a piece of the document (and at line 80, line 84) \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 \u0060cbor_to_json\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit/src/action.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2efc0eae32ee5c4a2442355c7945795c180fc13f6bf41bcaf1edc544b118a8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060Client\u0060 as its receiver from its caller, and it calls itself at line 143 with a piece of the document (and at line 146) \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":"rivetkit-rust/packages/client/src/client.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f17afb0baa9a2f7aecda650d48ffd0f2b8011aea50f731a3dfa158e4f5e57a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060action\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 48 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 \u0060action\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/simple/sync/handle.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b2bb5b33b76218a7e5267635d76305b78bee6b2e6a43c82ffababd00434159"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060disconnect\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 164 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 \u0060disconnect\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/simple/sync/handle.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"926de4143855b0c3f8963ce9f52098bc12422680b332bd5ee2b031e89515922d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060action\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 52 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 \u0060action\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/simple/async/handle.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23cd35e37e014c8ba256b5315002e30576ead0e8b9bef592346e9905b65d481"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060disconnect\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 180 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 \u0060disconnect\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/simple/async/handle.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26ad824173fdd4663ebcb4bd76a51b5cbfcbb1faa11228ceace4acb30973020"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060action\u0060 is public and takes a \u0060ActorHandle\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 \u0060action\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/sync/handle.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93c75b4a12f1175c62d830722850d7093602af4f4cc0dfd5abac9e4d2e31676"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060on_event\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 49 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 \u0060on_event\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/sync/handle.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe6a403fa5f4fb105c0bddcd98e1631276244e00c1a59ac0fc33d1242f5e673"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060disconnect\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 66 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060disconnect\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/sync/handle.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"14abb9621fd43697a2790e22ae19ed9418315bcc29f2b1712e6fadf8743b4cea"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060action\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 32 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 \u0060action\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/handle.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cce9ed9eeccea6ce646f460c27b2251996792a721eb15902699bd2138b75dc0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060on_event\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 69 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060on_event\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/handle.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a0a461801975605a625a1de314ec7897e1e194adbd727d20c9f6aee7c1a6fb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060disconnect\u0060 is public and takes a \u0060ActorHandle\u0060 as its receiver from its caller, and it calls itself at line 90 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060disconnect\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-python/client/src/events/async/handle.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fdc6de23b4defdbde9400d5af11a425c1082e0dbedd34ba413f90d92793dfe"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060tick_index\u0060 is public and takes a \u0060Backoff\u0060 as its receiver from its caller, and it calls itself at line 50 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 \u0060tick_index\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"543243e8f797f442a1ff53576ecfc3f1803b2360bde98bec767debf70b860773"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060current_duration\u0060 is public and takes a \u0060Backoff\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 \u0060current_duration\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb9d375c3ee20a6fe04ad21e7e36926c028fd91fb21e2b804bd424f4a470d15"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060tick\u0060 is public and takes a \u0060Backoff\u0060 as its receiver from its caller, and it calls itself at line 62 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060tick\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5ad892431db5ce33ec1899ed4e075849bd514e1d84ab36b1cd089c95992fa2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060step\u0060 is public and takes a \u0060Backoff\u0060 as its receiver from its caller, and it calls itself at line 67 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 \u0060step\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0e58acf3124c38aa9572a74b6a27dd4ce9d7f18f39269e5023e80ac8b50a65"}},{"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 139 with a piece of the document (and at line 141) \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":"engine/packages/pegboard-envoy/src/queue.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa856817c898ff46c4b6312ed2fb23266a94108a618636753a0093a40dde0dd"}},{"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 154 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":"engine/packages/pegboard-envoy/src/queue.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"489aea99f0e0f40ccce0a92c0cf8431c566ee96b7e4cb74a3c4be728fac173a9"}},{"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 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 \u0060try_send\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/queue.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b743b07d857b8ef8532d849fe2a8f5e742f12a26bf71b94810b1fc37c51204"}},{"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 191 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":"engine/packages/pegboard-envoy/src/queue.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c50f555bcc37709c1399b7d42e7643799ec644b30af2563d2789e2bae8f6ca"}},{"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 143 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":"engine/packages/pegboard-envoy/src/connection/inbound.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cf430baa16df7c22ba7aac9928b9c38b44f9d0382f41ca9c8b13b523786dea"}},{"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 158 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":"engine/packages/pegboard-envoy/src/connection/inbound.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97cb7c724820662e2041080b44a388ee1fe40dd13a3734a3cda5a701300e41f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060poll_frame\u0060 is public and takes a \u0060ResponseBody\u0060 as its receiver from its caller, and it calls itself at line 139 with a piece of the document (and at line 152, line 165) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060poll_frame\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/guard-core/src/response_body.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f0384270f5f3fa5cd6761addea9d03bf1e3985853623214c41398b923581dc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_end_stream\u0060 is public and takes a \u0060ResponseBody\u0060 as its receiver from its caller, and it calls itself at line 226 with a piece of the document (and at line 227, line 228, line 239, line 240) \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_end_stream\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/guard-core/src/response_body.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdda308f78306bf22f24481c1090892038a3d8df3650f197750f90283ed65641"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060size_hint\u0060 is public and takes a \u0060ResponseBody\u0060 as its receiver from its caller, and it calls itself at line 246 with a piece of the document (and at line 247, line 248, line 251, line 252) \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_hint\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/guard-core/src/response_body.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"546ab65cc567e2d5a83200f527b22588900d10012a121cd2bd38047a8a9538d8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shutdown\u0060 is public and takes a \u0060Client\u0060 as its receiver from its caller, and it calls itself at line 29 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 \u0060shutdown\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/epoxy/src/client.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee6f6fda2bfc06b11f06b68fba2d3a1849ca6d50cd20c456344feb37af9ef7f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060env\u0060 is public and takes a \u0060Client\u0060 as its receiver from its caller, and it calls itself at line 58 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 \u0060env\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/epoxy/src/client.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1d7ef5a2fa7d1688c4c8039adc090d760b43650a389335816d2b41fe4e024b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060replica_id\u0060 is public and takes a \u0060Client\u0060 as its receiver from its caller, and it calls itself at line 114 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 \u0060replica_id\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/epoxy/src/client.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"de197f43ff925469c9b699b31cc3648e8c6ae8418d808754ab958e593863e83d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shutdown\u0060 is public and takes a \u0060VolumeHost\u0060 as its receiver from its caller, and it calls itself at line 929 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 \u0060shutdown\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2b5d3d850e6c32dd1518897e7101cc068a48372e65dd425db14f18df33a6c3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060disposition\u0060 is public and takes a \u0060Error\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 \u0060disposition\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/volumes/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccde49b8e6213e07cd5ceaf762bdffc12a04c85b05197e81a6baf9486683b825"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fence\u0060 is public and takes a \u0060Filesystem\u0060 as its receiver from its caller, and it recurses at line 1321 through \u0060fence_with\u0060 and back with a piece of the document (and at line 1344) \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 \u0060fence\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a232d08ef90b83a26c3428fe148a1c7d14d447b632102fa2ce4dec7efd827e2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060status\u0060 is public and takes a \u0060Filesystem\u0060 as its receiver from its caller, and it calls itself at line 1368 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 \u0060status\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec3372109bb09cb95b91004927a0683c36dbb3b73a97479ee54d9f1be399945"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reclaim_closed\u0060 is public and takes a \u0060Filesystem\u0060 as its receiver from its caller, and it recurses at line 2425 through \u0060remove\u0060 and back with a piece of the document (and at line 2165) \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 \u0060reclaim_closed\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b964edeae18460ed0038a7df812dd64182dde948e38a4c6373a40a14327eaecc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060close\u0060 is public and takes a \u0060Filesystem\u0060 as its receiver from its caller, and it calls itself at line 1873 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 \u0060close\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/client.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23220dc81c77052e420690799fcc9e13ddd8be853db124aeba1993f9af33747"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060retry_after_ms\u0060 is public and takes a \u0060Error\u0060 as its receiver from its caller, and it calls itself at line 124 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 \u0060retry_after_ms\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b95cbb11fcf40cf0f53c9c6a362c824d7cb677177564e03a977a73ba3d8e69"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get\u0060 is public and takes a \u0060Transaction\u0060 as its receiver from its caller, and it recurses at line 733 through \u0060get_untracked\u0060 and back with a piece of the document (and at line 764) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060get\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/transaction.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f71af03bab902c8f5352af51b2ef5d9c6c83383997a7c39abc9cecfe4d43127"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060execute\u0060 is public and takes a \u0060Opts\u0060 as its receiver from its caller, and it calls itself at line 27 with a piece of the document (and at line 28, line 29) \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 \u0060execute\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/commands/cluster.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c832e5bd51bbd503159e36bd774d964e62a7d14136de2b78790946ff4f678ae7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060execute\u0060 is public and takes a \u0060Opts\u0060 as its receiver from its caller, and it calls itself at line 67 with a piece of the document (and at line 68) \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 \u0060execute\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/commands/pool.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eab6dde197d5074b420edfc0bb3c33675202fc9dd0b3f5ed5373000b4cafdf8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060execute\u0060 is public and takes a \u0060Opts\u0060 as its receiver from its caller, and it calls itself at line 25 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 \u0060execute\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/commands/token.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e9ae6fbe74e3b502f443295acbac794363edbe5b758d55275a7395e146dfbd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060execute\u0060 is public and takes a \u0060Opts\u0060 as its receiver from its caller, and it calls itself at line 79 with a piece of the document (and at line 80, line 81) \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 \u0060execute\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/commands/cluster/env.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ebc41d20f0ece59014e129c936f4321a134b52e51b791d83556d6ea224aa27"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060execute\u0060 is public and takes a \u0060Opts\u0060 as its receiver from its caller, and it calls itself at line 84 with a piece of the document (and at line 85, line 86) \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 \u0060execute\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cli/src/commands/cluster/secret.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e5767de9d5bb551f0f15f7975f6d770329ba8ba04dc939b23e6125b55525af"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(old)\u0060 (line 993) takes \u0060old\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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea172ccf942c3ee9d37219cca582063f456c6830cf21fb0f87c4d29d39065d1"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(old)\u0060 (line 1008) takes \u0060old\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":"rivetkit-typescript/packages/rivetkit-napi/src/actor_context.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"900572c6ee7e6832716e4ad3d50de31ff8034ef0adacf7dd038624d2a43c215c"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060transaction\u0060 (line 891) is a transaction released by \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) only on the path that reaches line 897; the \u0060return\u0060 on line 897 leaves before that with a success value, and on that path a transaction that is dropped rolls back, so every write made through it is silently undone. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/mod.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47ee759e17986e6d95ae8a7816b254823bac6545bda9d474e51c4df65e78fd9"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 144) 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":"engine/packages/pegboard-envoy/src/kv.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0047e113e68b93f8a907d3d6b8138101c0bb99351832ec66ef142e5678b42a25"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 169) 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":"engine/packages/pegboard-envoy/src/kv.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9a945b984078255f1d861626afec6c12a46af4867c2b964a38699275eea52f"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 203) is a transaction released by \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) only on the path that reaches line 238; the \u0060return\u0060 on line 232 leaves before that with a success value, and on that path a transaction that is dropped rolls back, so every write made through it is silently undone. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/kv.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e36006fdd7b0903f1261ae8dcdae3ace44490dbd4ff91adb36431e186e1856"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 43 is called with an argument built by \u0060JSON.stringify(c.req.header())\u0060 (line 53), whose cost grows with the collection it walks. JavaScript 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 debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isLevelEnabled\u0060/\u0060isDebugEnabled\u0060 test, no debug flag, no \u0060NODE_ENV\u0060 build switch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-typescript/packages/rivetkit/src/common/router.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb11d4fa1d49de4e726e7bcd031ece65efe30b8d3c153c9e99b7e0e7b0fc3e51"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060tracing::trace!\u0060 at line 213 is called with an argument built by \u0060reply.pages.iter().filter_map(|(_,bytes)|bytes.as_ref()).map(Bytes::len).sum::\u003Cusize\u003E()\u0060 (line 225), 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::trace! 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":"engine/packages/sqlite-prefetch/src/driver.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f00644a277be8d99096f06b0b583402b51f543ef3ec8ee3811cd30c052eca7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Logs.redirect_logs_dir\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":"engine/packages/config/src/config/logs.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1467457a872c08e3935752a707f890810ecf7ed8a58305aa3a94cec600f86e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Pegboard.gateway_port\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":"engine/packages/config/src/config/pegboard.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9479a8f927ec62786f3257d933e0b738895a65361982f2ded242a506dfe260"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060ServicesVersionOutput.rivetkit_version\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/services_process.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"57eea3c48be59144a03398bfa5be20dc6a0c6d7d88230cedfde259a6d058f21d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ServerlessActorPreload.prefixes\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":"rivetkit-rust/packages/shared-types/src/serverless_metadata.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f33e9917e5ccd77f05e2dfd64446996be1d198dd61703fac7bc45981106cf2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2978 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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2258ff9a60396b034a52dc4fef7394559d802a69d67ffbf004bce142f1b917"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 3027 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":"rivetkit-rust/packages/rivetkit-core/src/actor/task.rs"},"region":{"startLine":3027}}}],"partialFingerprints":{"codehealthFindingId/v1":"facaedb655da40f64b0230a12564d888864e8b1f4b6246297a7526bda56baf7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 232 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":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"15946c2584747e259d0eb7fed87b510e8aef3335f7fbeeb58305c17b09bea875"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 274 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":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"520a7a9aa4536859d7444c94cf18bf5ec9ae42fce50d614ab7f47cddb5b33095"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 316 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":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e8e4b7dea54f8852d9bb6473c83d806a27829dcf8df1dea94c649c0eb4a1a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 345 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"016069cfcc5ed7b46724277ab1c91cdff0c454e6b76e3f69b167b3ef9f8c5531"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 352 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":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6e15bb88044d805cbadabba09b348edfb3183d046a561eb37673a30bf13daa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 766 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":"rivetkit-rust/packages/client/src/connection.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac82eadd39890b5353bc0b8486f2649edcab25be8a89579d92783e487f723d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 72 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":"rivetkit-rust/packages/client/src/drivers/ws.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f429365f0b0ddec0f8b31456e1dc316704f5f243207d949d491e192fa295adb5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 78 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":"rivetkit-rust/packages/client/src/drivers/ws.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"254623a4c26a661f8b18655f3c1913ff65fdc38d9b26384a5c3e6de742563f9d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 93 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":"rivetkit-rust/packages/client/src/drivers/ws.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2e973a521c471f9cd72978c4fc95831de371dc810cfd49bee439f711e78a0a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 98 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \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":"rivetkit-rust/packages/client/src/drivers/ws.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42472de16b173c66f6b71225886056225b5d578922bfc11283bc72573cb4b5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 114 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":"rivetkit-rust/packages/client/src/drivers/ws.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"908082d8fbc0c31537d8fb6e9b8e417371f1ac096e6bc2ba29a97f6668e8490d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 86 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \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":"engine/packages/guard/src/lib.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19ca7de2f3368bb8373bf759acba5d74b4af7724539f2a9def6450d347b8619"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 197 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":"engine/packages/guard/src/lib.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ffdbddb0fd66a0be0497665dfc87a70a3afd1c0c3cc7684ccc3123602f1356"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 202 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":"engine/packages/guard/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4770c50c4764d74a0ff4830f9decad6aada48776243491317b742040daf26634"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_serialize_size\u0022,\u0022size in bytes for any serialization\u0022,).buckets(serde_size_buckets()),SERDE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/serde_metrics.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a29c51762aa6bde748bb116b63dd79cacd9c9304001bb520c4eb4cb914c1f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_deserialize_size\u0022,\u0022size in bytes for any deserialization\u0022,).buckets(serde_size_buckets()),SERDE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/serde_metrics.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e6cc4fd405f0198c64484857d13df76b398b7147f507bb27dad6ef42450380"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_serialize_duration_seconds\u0022,\u0022duration in seconds for any serialization\u0022,).buckets(MICRO_BUCKETS.to_vec()),SERDE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/serde_metrics.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bc7600791bff3e29057c27e04e0d168d5d567a1b9ed71300eed7c76b265e41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_deserialize_duration_seconds\u0022,\u0022duration in seconds for any deserialization\u0022,).buckets(MICRO_BUCKETS.to_vec()),SERDE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/serde_metrics.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9f458cd31a9fc5f764b6174e904867b3595d7b8e91f45ab0474695633cf998"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060route_path(base_path,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 \u0060handles_listener_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/serverless.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"6171ae5cce9cf8c693d3c6730e3441d693eaa8bda0c9b09bb9511d201a238c9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.span.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 \u0060span\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/telemetry.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8147c1d1c5d37a247552022b73292344c3b191ed1dc45057ec3a6d0859d9132"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060StatusCode::from_u16(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 \u0060framework_error_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":"rivetkit-rust/packages/rivetkit-core/src/registry/http.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0420d999cdb90ec90e0e81a7806387e3cd84bae625beb2fc3b42b801099cfa9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dispatch_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.expect()\u0060 in \u0060dispatch_scheduled_action\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef50a2850f1aa6becd64c144f2a977a8b71bac9b0f0f5cb2d444045079790bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dispatch_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.expect()\u0060 in \u0060dispatch_scheduled_action\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac5dc4c606d3de27605d257d41c68f5272b51dca7cf0d7e68a3ea1b3f302e67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dispatch_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.expect()\u0060 in \u0060dispatch_scheduled_action\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/context.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d4291d1adbe2bbe68c7ff096294c83b2cfe5f64ea289bb8faf5c410ab037b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SQLITE_PROFILE_METRICS.duration_seconds.lock().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 \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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"f327ab455b7bb0a8d0138a4e9de9b91be69859e8a466ee41beb759924a72ffd0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_sqlite_operations_total\u0022,\u0022SQLite operation count without duration buckets\u0022,),query_labels,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"093b2fce0c2e449612dbbf01593606e66e5819cd5056698db8291ce3c5b0c569"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CounterVec::new(Opts::new(\u0022rivetkit_sqlite_duration_seconds_total\u0022,\u0022cumulative SQLite operation seconds without duration buckets\u0022,),query_labels,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac82557a4126e131f4a462cc02828d602a6f25fd1ebe6ab3664bacaadc701c3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_sqlite_pages_fetched_total\u0022,\u0022pages returned from storage per SQLite statement\u0022,),query_labels,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"042b3cc51d252ea7ce162782ae12c239cc02474357a6fed9180673b1efa8220f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_sqlite_phase_duration_seconds\u0022,\u0022SQLite operation phase duration in seconds\u0022,).buckets(sqlite_worker_duration_buckets()),\u0026[\u0022actor_name\u0022,\u0022type\u0022,\u0022fingerprint\u0022,\u0022fingerprint_source\u0022,\u0022transaction_mode\u0022,\u0022storage_transport\u0022,\u0022phase\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5602ab21b5ee42e34b5868ec7cce89d521c47c953d7acee33ed88aea060c38"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_sqlite_get_pages_round_trips\u0022,\u0022physical get_pages calls per SQLite operation\u0022,).buckets(sqlite_round_trip_count_buckets()),\u0026[\u0022actor_name\u0022,\u0022type\u0022,\u0022fingerprint\u0022,\u0022fingerprint_source\u0022,\u0022transaction_mode\u0022,\u0022storage_transport\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a03ef50a1a6c5b48344c2fb327181827291d6b77953fb04598139cc43d3820"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_sqlite_transaction_statement_count\u0022,\u0022user statements per explicit SQLite transaction\u0022,).buckets(sqlite_round_trip_count_buckets()),\u0026[\u0022actor_name\u0022,\u0022type\u0022,\u0022fingerprint\u0022,\u0022fingerprint_source\u0022,\u0022transaction_mode\u0022,\u0022storage_transport\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"e293e546f4610707dbf9ff99d1827842b566a575787e2708d6a8dcfefdaceacd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_sqlite_outcome_total\u0022,\u0022SQLite operation outcomes\u0022),\u0026[\u0022actor_name\u0022,\u0022type\u0022,\u0022fingerprint\u0022,\u0022fingerprint_source\u0022,\u0022transaction_mode\u0022,\u0022storage_transport\u0022,\u0022outcome\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa4350c8c6ecc77216314356eb3d6ba833833326209beb83ae5c74b20cfd5de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_sqlite_local_pages_total\u0022,\u0022local SQLite page totals\u0022,),\u0026[\u0022actor_name\u0022,\u0022type\u0022,\u0022page_kind\u0022,\u0022storage_transport\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b2d77babc13ee25b201ad8d1a9d152eb3f0b4ae5323e5ccedf8618e8274f88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_sqlite_local_bytes_total\u0022,\u0022local SQLite logical byte totals\u0022,),\u0026[\u0022actor_name\u0022,\u0022type\u0022,\u0022byte_kind\u0022,\u0022storage_transport\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7c7968867c41fdffbf32e3b5218bfd52a5f389798621e2755faf8d8c77773d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_sqlite_get_pages_duration_seconds\u0022,\u0022physical get_pages request duration in seconds\u0022,).buckets(sqlite_worker_duration_buckets()),\u0026[\u0022actor_name\u0022,\u0022request_ordinal\u0022,\u0022outcome_class\u0022,\u0022storage_transport\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"525025142dcdf39ae07684fefb97ca8a812d2c650e240fc747de0efd56fbf32d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_sqlite_get_pages_pages\u0022,\u0022pages per physical get_pages request\u0022,).buckets(sqlite_round_trip_count_buckets()),\u0026[\u0022actor_name\u0022,\u0022request_ordinal\u0022,\u0022page_kind\u0022,\u0022storage_transport\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f6b6f11d02b85481f12f17a0ef489fa656137ba473c1ec36d0226fba113169"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_sqlite_get_pages_response_bytes\u0022,\u0022bytes per physical get_pages response\u0022,).buckets(vec![512.0,4096.0,16_384.0,65_536.0,262_144.0,1_048_576.0,]),\u0026[\u0022actor_name\u0022,\u0022request_ordinal\u0022,\u0022storage_transport\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7c6d56eace7bc09a5c393ae051c7f20fddee309bd0ffc5c284b0086f18cafe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_sqlite_get_pages_missing_pages_total\u0022,\u0022missing pages in physical get_pages responses\u0022,),\u0026[\u0022actor_name\u0022,\u0022request_ordinal\u0022,\u0022storage_transport\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acd8b292727022909e4c4684101191e3ca77bde40da4f3e26b5c2225437ab68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_sqlite_fingerprint_overflow_total\u0022,\u0022SQLite observations routed to the shared other fingerprint\u0022,),\u0026[\u0022actor_name\u0022,\u0022type\u0022,\u0022reason\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6680f72379e7f185393496ce7ae689f549685427c3f270423705f79dfe3186"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_sqlite_event_dropped_total\u0022,\u0022SQLite diagnostic events dropped before export\u0022,),\u0026[\u0022actor_name\u0022,\u0022reason\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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7b7df1fe51c3e797f3da2d91822397b76fa6a329c52287735773c820142198"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_sqlite_worker_queue_depth\u0022,\u0022queued native SQLite commands\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"050baddd656e5c49d9ce09dcda68808763849669c6d6f8d3eddb5cda1bee965b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_sqlite_worker_inflight\u0022,\u0022native SQLite commands executing\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b5aec822990106d509d1ab063ba541077d8bb12926efde6a18a12e327be842"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_sqlite_coordinator_queue_depth\u0022,\u0022operations waiting for SQLite transaction coordination\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f111ab80d516939886a0dc16d697533279bd8dd7453bca297539ebc7f053a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_active_count\u0022,\u0022current active actors in this process\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"81839a96befe45639cf3bab82461e03edd794461e7aef0863e29d81684126f2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_started_total\u0022,\u0022total actors started in this process\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04dbb9e552ec9e38de1c15d08fce990892abc5ed1a7aa015e03b48d19976e88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_stopped_total\u0022,\u0022total actors stopped in this process\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d22285ce909a52af5b748ca5250479ab37a475e2cf5909131f74e5d6ca649b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_startup_phase_duration_seconds\u0022,\u0022actor startup phase duration in seconds\u0022,).buckets(startup_duration_buckets()),STARTUP_PHASE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d5b6af183a28a687343caed60dfcd665ed9cb36c51046f4070f67077effd92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_create_state_duration_seconds\u0022,\u0022typed actor state creation time during startup in seconds\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"73564c51104f2ba3fd1f5173dbf7026c9de0eb11cb60ae34518cf13f456d3ec5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_create_vars_duration_seconds\u0022,\u0022typed actor vars creation time during startup in seconds\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a3505ded7c6960aa8de8761961274f481d5e9babc05b40a50a37f8f34a05d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_runtime_callback_duration_seconds\u0022,\u0022foreign runtime lifecycle callback time during the startup preamble in seconds\u0022,).buckets(startup_duration_buckets()),RUNTIME_CALLBACK_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"303664ec63555f170c5e3e5a7e9f775fa7db943bc5ad2ffaaed6bce54a85e897"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_queue_depth\u0022,\u0022current actor queue depth\u0022),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb6d50695f4099fab0cd37a4e9fccaf67e745beae105bd6a1a14f2f8da9358b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_queue_messages_sent_total\u0022,\u0022total queue messages sent\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"50294daa314072a39e668ba8534fe3ed34b981dad5586e8c306a707426bfbd02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_queue_messages_received_total\u0022,\u0022total queue messages received\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"85354a87a38aeafd76908c2639ed6e2add0e1acb709222ce03fe42f869625db6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_connections_active\u0022,\u0022current active actor connections\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"41144e3884c8cb6124a8600601b323e7ebae9c47b2f4e3ddee2a221e2bbbfc00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_connections_total\u0022,\u0022total successfully established actor connections\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9117ee36da9413caed5b72d04a21b86ea066606792318280625ac0197fa98749"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_inbox_depth\u0022,\u0022current actor inbox depth\u0022),INBOX_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"50167f092b75d1e6d9326033432903a52644a7c0bd277cc3e756669a936ca66b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_user_tasks_active\u0022,\u0022current active actor user tasks\u0022,),USER_TASK_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0a84a895fb10c1787649d4c934410f7cb41f4215fac04b107b3beb2bff7f92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_user_task_duration_seconds\u0022,\u0022actor user task execution time in seconds\u0022,),USER_TASK_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7de16fc1f4da4d274a6c5d267761fbf38e6c869ef9e022ea8410709815247a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_http_requests_active\u0022,\u0022current actor-scoped HTTP requests\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f19a464305fa24285d65f873abaced24d4a5b7fdb1d400748210d630e0ab71"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_keep_awake_active\u0022,\u0022current actor keep-awake work\u0022,),WORK_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"845638bef9f29c335391059ae67dcc487e391b7d6d40f42449861e796e132bdf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_shutdown_tasks_active\u0022,\u0022current actor work draining during shutdown\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916e7bcca52792128e985a3760217c8ee5e5a50f4a51ae025c64a7bdba442e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_shutdown_wait_seconds\u0022,\u0022actor shutdown wait time in seconds\u0022,),SHUTDOWN_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf83dc7869144fd826042b06954d305137c3521da80f0205c905ca3a678436e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CounterVec::new(Opts::new(\u0022rivetkit_actor_shutdown_timeout_total\u0022,\u0022total actor shutdown timeout events\u0022,),SHUTDOWN_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"731d2f5066c01e08bdfcf983a0c0b1a5ca0ef15ea00611e15676de6af140dcae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CounterVec::new(Opts::new(\u0022rivetkit_actor_state_mutation_total\u0022,\u0022total actor state mutations\u0022,),STATE_MUTATION_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fe6491c9d2a6553431e6a2f938f6ab99fc79a2aab9402edd391b3a82ba6eee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CounterVec::new(Opts::new(\u0022rivetkit_actor_direct_subsystem_shutdown_warning_total\u0022,\u0022total actor shutdown warnings emitted by direct subsystem drains\u0022,),DIRECT_SHUTDOWN_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1ed627889d71baf22a8cb78dff168b80052ce3ddee3da45b1dad9d95ef3bac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_sqlite_open_phase_duration_seconds\u0022,\u0022native SQLite open phase duration in seconds\u0022,).buckets(startup_duration_buckets()),SQLITE_OPEN_PHASE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31885d0e7342c04904ebc6408abd92e11de2805668da1bec8beafbab1b7dcb2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_startup_preload_pages_total\u0022,\u0022total SQLite startup preload pages requested or loaded\u0022,),SQLITE_STARTUP_PRELOAD_PAGE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f86cda1d14832072492c295b945affdb07ea30c7aa5abe180b9e74c48dcd855"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_prefetch_unused_pages_total\u0022,\u0022prefetched SQLite pages discarded before first use, including close and TTL expiry\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd70f4a7927f498b35fef677091208aa33295b064beb4202f1a59cc5bb6b27c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_resolve_pages_total\u0022,\u0022total VFS page resolution attempts\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"973b9fa233e9ab22a65fb6e8d3ef0ff2014cb8bfa0f139ee59f1c9a96504228c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_resolve_pages_requested_total\u0022,\u0022total pages requested by VFS page resolution attempts\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19684af476db63e75e4208dd70fca42e5054dcc30783a612ab2cabdde4ae261"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_resolve_pages_cache_hits_total\u0022,\u0022total pages resolved from the VFS page buffers or write buffer\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9b8c7c65d917fb0f2794f50dc196d7c514538aeddbf1b4a5dce02c832411ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_resolve_pages_cache_misses_total\u0022,\u0022total pages missing from the VFS page buffers and write buffer\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"df79bf096ece37640016ee0af1dae9d0719e1850d4a3b11a523d415ed1fae786"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_get_pages_total\u0022,\u0022total VFS to engine get_pages requests\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f713097dbf447624c305606a5a416704fbd2b1e8a9d706f4a5427a6cc6bbd87e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_pages_fetched_total\u0022,\u0022total pages requested from the engine by VFS get_pages calls\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"737ad980fe9e4ad4055d6117bd5082c616d2ad99bbd6407aff668bdebe054c4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_prefetch_pages_total\u0022,\u0022total pages requested speculatively by VFS prefetch\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a609120895780d66636f1755d5cdd2b371abdbc524c36eef97a17d9d222b627"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_bytes_fetched_total\u0022,\u0022total bytes requested from the engine by VFS get_pages calls\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4055bd9a9f0f8352aeb780004100465096217b65cf7f2f65aefd205b3fe55e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_prefetch_bytes_total\u0022,\u0022total bytes requested speculatively by VFS prefetch\u0022,),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91eb6118eb82477ab07c2049a86795a715446d8cbe3d0cd6c2957032f77cbed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_sqlite_vfs_get_pages_duration_seconds\u0022,\u0022VFS get_pages request duration in seconds\u0022,).buckets(vec![0.001,0.0025,0.005,0.01,0.025,0.05,0.1,0.25,0.5,1.0,2.5,5.0,10.0,]),SQLITE_VFS_LIFECYCLE_BUCKET_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"526933e32e958efb665204100d23ba9ea44a70d27d8928351f729bb709fab798"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_commit_total\u0022,\u0022total successful VFS commits\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4434364823ca1a69254e5837e2aa79918fb3f33c8a3b72ff3ca7115c144608"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_sqlite_vfs_commit_dirty_pages\u0022,\u0022dirty pages written by each successful VFS commit\u0022,).buckets(rivet_metrics::PAGE_COUNT_BUCKETS.to_vec()),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"889db7e4a47eb9a0d332851c126047cdf77a6065c933cb7b1481aae79b5f0179"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_commit_phase_duration_seconds_total\u0022,\u0022cumulative VFS commit phase duration in seconds\u0022,),SQLITE_COMMIT_PHASE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2f6df51ca4fe12ed61b317c35f3f08486365d1b62d87eb7f311169a7281993"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_commit_duration_seconds_total\u0022,\u0022cumulative VFS commit duration in seconds\u0022,),SQLITE_COMMIT_PHASE_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e4bb2e0bceecc40aa591acf8e5e25913e9f4be51bcf15261c2aa1665029790"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_sqlite_worker_queue_depth\u0022,\u0022current native SQLite worker SQL command queue depth\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"e586a3af8d592d849e1a8f760412a63b82b058967be1bdc263ec19d03da275ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_sqlite_vfs_cached_bytes\u0022,\u0022bytes held by native SQLite VFS page buffers\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"023811ea6c9781687cd2e9415c0a72aac0e5329c04a2ff54c865807d611790bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022rivetkit_actor_sqlite_workers_active\u0022,\u0022current active native SQLite workers\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"92260c826149ba1ceb52a1acabdababda73384b375258e12de340f9b6f30f584"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_worker_queue_overload_total\u0022,\u0022total native SQLite worker SQL command queue overloads\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb187cfb098e05ef4cf100fe053a48818d4976626fff1d3d3412dc809f422c7d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_sqlite_worker_command_duration_seconds\u0022,\u0022native SQLite worker SQL command duration in seconds\u0022,).buckets(sqlite_worker_duration_buckets()),SQLITE_WORKER_COMMAND_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3358f67404201edfa7343a7578a18f2599112d095ddf28bb1968db169f5fbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_sqlite_transaction_round_trips\u0022,\u0022network round trips (get_pages \u002B commit) per native SQLite transaction\u0022,).buckets(sqlite_round_trip_count_buckets()),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c56969aa3f0b4dce1ee6971c411fd54f65350a68721b9b90f5dbba5f0998dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_worker_command_error_total\u0022,\u0022total native SQLite worker SQL command errors\u0022,),SQLITE_WORKER_ERROR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"04388e6da1d210702a19e6672a9cf7af9d8267339cf0dc4089fc44ade9d53312"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_actor_sqlite_worker_close_duration_seconds\u0022,\u0022native SQLite worker close duration in seconds\u0022,).buckets(sqlite_worker_duration_buckets()),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"0101a38fd84596df8fd658c11ae023b6dac675d6c95d5e53f2facc2bc0d3b571"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_worker_close_timeout_total\u0022,\u0022total native SQLite worker close timeouts\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5661af18fda113ee2f4aeaa4d761c9bc8736d72bf3ac4c14c6bb718fe612d69a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_worker_crash_total\u0022,\u0022total native SQLite worker crashes\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f92cdf6f071f9ceba88c21b692858383ef25b3c09ce3692e5ff5239d4d5e800"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_actor_sqlite_worker_unclean_close_total\u0022,\u0022total native SQLite worker channel drops without clean close\u0022,),ACTOR_LABELS,)\u0060 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":"rivetkit-rust/packages/rivetkit-core/src/actor/metrics.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a55a48b6016aa2ef3f51850d78b626639867ed3c2e3059ef562f86e95a2f67a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060existing.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 \u0060cron_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36c737352d93fabb697656b0230396c811c971a7f3da6b9a09dae056c7f7646"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060existing.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 \u0060cron_every\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/schedule.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0687be8d6a62a638d0e3f77ed94526fab61b8fab70c4d6121e4d65a4395a8239"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.active.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 \u0060release_transaction\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0e30db02a45cc5cd789e76f3d42011afe8879ff62ee1a82fc6f89288ba2587"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060remote_session\u0060 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_transaction_timeout\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/sqlite/tx.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9431520bd47baf58ced3e5612d9b196e29097f7bf613ed1a96e6b977f7da392b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060names.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060load_queue_messages_matching\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afbb25817c0d954e357c787846b18bb3acbcbddd18fd66961e70b6a083e1030"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060names.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060has_queue_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":"rivetkit-rust/packages/rivetkit-core/src/actor/internal_storage/mod.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49640710056761beb7c7b0f7b82e4766811ad547feb6a58c9d2f98ad0a1d6f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Response::builder().status(StatusCode::INTERNAL_SERVER_ERROR).body(Body::empty())\u0060 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_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":"rivetkit-rust/packages/rivetkit/src/serverless_listener.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e585d201c23aecdfe9243cc142e2beb431d67aa4d679bd53b1d39863dd4d29"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060unit.downcast::\u003CA::Input\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 \u0060decode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/rivetkit/src/start.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee457df8ee455e0d90734e45997d8b280fa68ad03f2fef2df2644898a0b204ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(\u0026output_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 \u0060generate_versions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/build.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e903864f0faa75cb91e692e997ebbeacfb63ff93c012a2868e68274bb9e546"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema_path.file_stem().and_then(|stem|stem.to_str())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_versions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/build.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1065ecff7bd505c2e461cf1b110678d8d99df14f34ba58343bbf656c2afebe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0026cli_js_path).arg(\u0022compile\u0022).arg(\u0022--generator\u0022).arg(\u0022ts\u0022).arg(\u0026schema_path).arg(\u0022-o\u0022).arg(\u0026output_path).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_versions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/build.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1050b377528cbb4d961f9bae19a879fd2947c30dde9e340420b0d964d34d9675"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(schema_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 \u0060schema_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/build.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4ea9b2621d84fbe08ddc7087a1925da4fcfe3d0ab94f2031afde62d4b956f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(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 \u0060post_process_generated_ts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/build.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cf3010ec046e9a729df8d276dfb5b257e4431ed78c437366bbb6c03608476f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(path,content)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060post_process_generated_ts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/inspector-protocol/build.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b15464f73e2fd71de45ff3fcac81557298d61d3008e8cf7c907c73197bb34f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(\u0026output_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 \u0060generate_versions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client-protocol/build.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb861e1594c89238d2a11d6a379605065ae8e7b4356c796963cf2117941434b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema_path.file_stem().and_then(|stem|stem.to_str())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_versions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client-protocol/build.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb9e8492e13f98803f73526949872176fae317ead25a40a2dc0dba3ab71e9eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0026cli_js_path).arg(\u0022compile\u0022).arg(\u0022--generator\u0022).arg(\u0022ts\u0022).arg(\u0026schema_path).arg(\u0022-o\u0022).arg(\u0026output_path).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_versions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client-protocol/build.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cac4b65079436e7f798622585acfabd200bfda9316fec531d5c765cc7e7d44"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(schema_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 \u0060schema_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client-protocol/build.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1fb9caf060fce73e6e3e6f48c9ac860dd885162d0c89c6e274c9afb2c17e6c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(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 \u0060post_process_generated_ts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client-protocol/build.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"943a2424d0d3929b35fd70de016ec672e9d231863348d099080c5d7084ff68ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(path,content)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060post_process_generated_ts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rivetkit-rust/packages/client-protocol/build.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b727a566e85c3d8af6e66094a43bc4812104e295a8f2987de8168bdbccf283"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(schema_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 \u0060find_highest_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/epoxy-protocol/build.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f95fca78b3ef677ed185c85d70489e9b6c773bebc313cffcb0e0dee6d4cc145"}},{"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 \u0060find_highest_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/epoxy-protocol/build.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"716d277c885d77b51ee6cb89d08389fda0fded6b502250141444c4b428ff8555"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_highest_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/epoxy-protocol/build.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"76524f64a9684f87ba631ad3b907a076d674f1dc2572c13d71ba768ccc8ad970"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name().unwrap().to_str().unwrap().split_once(\u0027.\u0027)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_highest_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/epoxy-protocol/build.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d474e6c03d3acafbfa6a5318e6444559ce608aad037272e2071b84dc1d01f8c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060workspace_root.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":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4336049e8bd2a7b5d900ad1991762e069694f7c57342d1ae27888d9bb7a9a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::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 \u0060generate_sdk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e9590326d2339bc541b41e7847cf821288363751949b251206b8daac4d5910"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Path::new(\u0026manifest_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.expect()\u0060 in \u0060generate_sdk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8202d267a61dfb19a9f9fe63b9624fe67b61a7334d6f94a94ce41c69f914236c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060workspace_root.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_sdk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bab6c44970f5df5e03f06f8221262a803f40d72c62bc450f8b4748c8fc9ba2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(workspace_root.parent().unwrap().join(\u0022node_modules/@bare-ts/tools/dist/bin/cli.js\u0022),).arg(\u0022compile\u0022).arg(\u0022--generator\u0022).arg(\u0022ts\u0022).arg(highest_version_path).arg(\u0022-o\u0022).arg(\u0026output_path).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_sdk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc72ffcd7b0ca55540e6bc024aab54edc57328c4a28ad26d72c36251cbbb7b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(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 \u0060post_process_generated_ts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e76981fdddd24c975c11e3fe97ef54c70216ae39f5396125c25f171bf9577d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(path,content)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060post_process_generated_ts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"673a8a53033ede2ed72d2bc0f3e391144308eb645a892dd9da065a7a4472142d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(schema_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 \u0060find_highest_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5248b9eca760e0e6f2a959db50290cdf9df9e46c27760ebf46cd3184343b4fb"}},{"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 \u0060find_highest_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d09dbf0b2caa61ab61a04405d52f16c21a8ce1336c8f715d5c7581f66a7fc6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name().unwrap().to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_highest_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c9df8a4bcb56a5b52122382967d0016ed904c6b2a8ef72f9e0e8a8e5ce55e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name().unwrap().to_str().unwrap().split_once(\u0027.\u0027)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060find_highest_version\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-protocol/build.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5125e24e006953e5e359e5bf05bcbe4d7ff0d30fc52ee6f06b7c504e5e57e873"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060websocket_opens.requests.remove(\u0026(message_id.gateway_id,message_id.request_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 \u0060actor_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5b8b20df2ddfcc70687ba3367bffa7a7869cac1d8e6b3c5b369c26794952c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending_stop.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 \u0060actor_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e5c7079ab7287ff237c9f5274bc61aa82c9a9ad9edef35e2b0a826d45fcf79"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending_stop.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 \u0060actor_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/actor.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b310d59149ebfe3f7f775a606d7f8338e2f9f0becc23b09497f192347aee14"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.queue.pop_first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pop_due\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/deadlines.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fa7660d12a7141a9a7338450ad539f9c94e58b1c762e52989f546244baa15b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.kv_requests.remove(\u0026request_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 \u0060expire_kv_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/kv.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b37ebdfd9a1b97c99cac701b39fc928537342f75151a8bd4d93a31c4a174712"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060now_millis\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e70a60784f7e5386768f2fcbef6352785102845bee0f60686a3a62aae3ca45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_envoy_client_sqlite_request_expired_total\u0022,\u0022total VFS sqlite requests expired by cleanup (smoking-gun signal: was_sent=true means a request was abandoned without resolution)\u0022,),SQLITE_REQUEST_EXPIRED_LABELS,)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"974c2fe01c3a32ca8e07faf906da5812db1eab1bfc38c8bb467076f42abd1e73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_sqlite_requests_inflight\u0022,\u0022current in-flight VFS sqlite requests tracked in envoy ctx\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fb074a1ef766522b48cb99e11129e85a2f5bab7b690c7a463adb74a693f96e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_remote_sqlite_requests_inflight\u0022,\u0022current in-flight remote sqlite (exec/execute) requests tracked in envoy ctx\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"600834e16a90dd500ccd11908427981d276be67eb1fef15157ac3b7b28c627ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_kv_requests_inflight\u0022,\u0022current in-flight KV requests tracked in envoy ctx\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"322fdd795978ecd7ac9650b6793065a9c62a291011171a59def9a7f3a4a9cedc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_envoy_client_envoy_loop_iteration_duration_seconds\u0022,\u0022duration of one envoy_loop select branch in seconds; long tails indicate the single fan-in loop stalled\u0022,).buckets(rivet_metrics::MICRO_BUCKETS.to_vec()),ENVOY_LOOP_ITER_LABELS,)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08c34cac9ecf478980bf847945db778b62d2082812ea44fc82f8af4327f2366"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_envoy_client_ws_tx_lock_wait_duration_seconds\u0022,\u0022time spent waiting to acquire the ws_tx mutex in seconds\u0022,).buckets(rivet_metrics::MICRO_BUCKETS.to_vec()),WS_TX_LOCK_LABELS,)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d2121b99cee1d4590090106502432081936e0e4bfec5d73402b2493c5e5c34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_envoy_client_ws_tx_lock_hold_duration_seconds\u0022,\u0022time the ws_tx mutex guard was held in seconds (covers encode \u002B send)\u0022,).buckets(rivet_metrics::MICRO_BUCKETS.to_vec()),WS_TX_LOCK_LABELS,)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6220945256afd9f0f4854869392685ab3fcf5773142fbc52058bcfa1d19a98f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_envoy_client_sqlite_request_total_duration_seconds\u0022,\u0022end-to-end duration from send_sqlite_request call to oneshot resolution in seconds\u0022,).buckets(rivet_metrics::BUCKETS.to_vec()),SQLITE_SEND_LABELS,)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed7c7bff8db44fe0631d13d55e3d13f43fdc339add956fa7a5819c74cf2a444"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_envoy_client_sqlite_request_submit_duration_seconds\u0022,\u0022time from send_sqlite_request entry to envoy_tx.send return in seconds\u0022,).buckets(rivet_metrics::MICRO_BUCKETS.to_vec()),SQLITE_SEND_LABELS,)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2dbc0b8afce50db7a9ac672121841a5fb61c2f5dc032d47132686097f91afd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060HistogramVec::new(HistogramOpts::new(\u0022rivetkit_envoy_client_sqlite_request_wait_duration_seconds\u0022,\u0022time from envoy_tx.send return to oneshot resolution in seconds\u0022,).buckets(rivet_metrics::BUCKETS.to_vec()),SQLITE_SEND_LABELS,)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8c69a1d7b11f0e3bd71b3018531d89e8327d5495c35dc4fa44f4a316ec262b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounterVec::new(Opts::new(\u0022rivetkit_envoy_client_ws_reconnect_total\u0022,\u0022total websocket reconnect events by reason\u0022,),WS_RECONNECT_LABELS,)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9799c1e14638031806337f018bb65942626125f965dfc999b4cd6aad2a7922cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Histogram::with_opts(HistogramOpts::new(\u0022rivetkit_envoy_client_ws_session_duration_seconds\u0022,\u0022duration of a single websocket session from connect to disconnect in seconds\u0022,).buckets(rivet_metrics::BUCKETS.to_vec()),)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b04ad1fdaede2004f16d7469ccec6d392dc4946364b6344f47a2a0511b4900"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_envoy_tx_depth\u0022,\u0022current depth of the unbounded envoy_tx mpsc between WS read task and envoy_loop\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f79ecb69e5d2235b972a40c2d1bc97e41cf8bff2a267b792e61b61cd9e4d8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_http_detached_sends_inflight\u0022,\u0022current detached tasks sending terminal HTTP frames while the HTTP stream is saturated\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f26453879c5b1cac11654e5175234f26a24950269a9aa8c5bdd79f12b661cba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_http_detached_sends_capacity\u0022,\u0022maximum detached terminal HTTP frame sends per WebSocket session\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a348b72873ad6ca559a1d735fc7c4374853ecd56f4a1da3773d7753e33e54831"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounter::new(\u0022rivetkit_envoy_client_http_detached_send_dropped_total\u0022,\u0022total terminal HTTP frames dropped because the detached send budget was exhausted\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28be1049f0ce50c5f98ac7940fe18443f01c725d59829458c7b534de2f50dc3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Histogram::with_opts(HistogramOpts::new(\u0022rivetkit_envoy_client_ws_read_handler_duration\u0022,\u0022time the websocket read loop spends decoding and dispatching one frame, during which the socket is not being drained\u0022,).buckets(rivet_metrics::MICRO_BUCKETS.to_vec()),)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"720539646479df622b6d5c3ec53f3e8ae88d8261d00cd23033f68cd04d583812"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Histogram::with_opts(HistogramOpts::new(\u0022rivetkit_envoy_client_ws_decode_duration\u0022,\u0022time to deserialize one inbound websocket frame\u0022,).buckets(rivet_metrics::MICRO_BUCKETS.to_vec()),)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fb487f90e717c9c1f716b4b6be6501a77019fddd8f4eb739a288429295b30e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounter::new(\u0022rivetkit_envoy_client_ws_rx_bytes_total\u0022,\u0022total bytes read from the engine websocket; the rate of this is how fast this pod consumes websocket data\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9f3d08747f8a3d0ef1ec6a4d3fc8e9e72c487060a2c50d00510a282cac9122"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounter::new(\u0022rivetkit_envoy_client_ws_rx_messages_total\u0022,\u0022total inbound websocket frames read from the engine\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e726f3dd15b18b173c67bb1dcbcf79ed76af19b5988d3352d1ca8f84b05c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_stopped_floors\u0022,\u0022actors whose highest stopped generation this Envoy remembers\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc195df184a85171057e654bb7167032b6ecd25c5f025df485206602098a94a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_stopped_floors_capacity\u0022,\u0022configured cap on remembered stopped generation floors\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea989775e823ed88fa99e6416718a930b93b88f6e248730e3688224d4324177"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Histogram::with_opts(HistogramOpts::new(\u0022rivetkit_envoy_client_actor_start_seconds\u0022,\u0022time from receiving CommandStartActor to sending the actor\u0027s Running event, including the runtime\u0027s on_actor_start\u0022,).buckets(rivet_metrics::START_BUCKETS.to_vec()),)\u0060 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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"264eeb94d8537ee2f2862d7033e75d2eb65881c558ae36e964fc3bf24ce96ad5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_actor_queued_requests\u0022,\u0022HTTP requests admitted to actors on this process and not yet taken by their actor tasks, including requests waiting for an actor to start\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8dbbf4024ab77a435b691b66fbd83b1cb8d22c0fb4f3d6934b199050170993"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGauge::new(\u0022rivetkit_envoy_client_actor_queued_requests_capacity\u0022,\u0022configured cap on queued HTTP requests per actor\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c681b1f7a25db67adafa7643809bd8e2d23568f53c6718356be529d859613a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntCounter::new(\u0022rivetkit_envoy_client_actor_queued_requests_overloaded_total\u0022,\u0022HTTP requests refused because their actor already had the configured number queued\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":"engine/sdks/rust/envoy-client/src/metrics.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9584aab0343d58d4225db3cf65eed1196a9be28c1e39c54825fd5cfc5f571a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060request.sent_session\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_remote_sqlite_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":"engine/sdks/rust/envoy-client/src/sqlite.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca7701a4f47b92f0aaf32ff8119e279664933085db7a225980c289f041b00e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060request.expected_session\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fail_remote_sqlite_session_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/sqlite.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4f12ff05c56a37c619cf313eca84279bc3123369b5b1c0c497be714be01452"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.sqlite_requests.remove(\u0026request_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 \u0060expire_sqlite_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/sqlite.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"986af5917ad2808ae0b781b22f1b1bf32848fb6fac1aa24853b6dd2609a995e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.remote_sqlite_requests.remove(\u0026request_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 \u0060expire_remote_sqlite_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/sqlite.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"287d3d4feed8890bd0dc632e9d10e55fc80707e751f4550a3f44f94546701b94"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026error)\u0060 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_error_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":"engine/sdks/rust/envoy-client/src/tunnel.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54f34144d86b21149cefad68a0c7cf4e211dd30c62108c1f8fb722d504ef872"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(schema_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 \u0060find_min_schema_versions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/build.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"93899b08b1d2efe6c5360a222c6a602961e88233de8b9d1e49ae1749e3b7ee5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(schema_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 \u0060find_schema_versions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/data/build.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb21f345b0e0717b1a33ed77201a25787414f731153fcddae89294483222367"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060time::SystemTime::now().duration_since(time::UNIX_EPOCH).unwrap_or_else(|err|unreachable!(\u0022time is broken: {}\u0022,err)).as_millis().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 \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":"engine/packages/util/src/timestamp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a56eac8f109eda5e9da4b066dbe138794860b82ada9cab6a7a33a4c2bbd77f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rivet_env::TokioClock::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 \u0060new_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":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"783bce158e55172a41ac7a25898cb88ec056cf67d3801e4a75fae91c1c7b6e17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clock.observe()\u0060 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_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":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f67be4f2dba402cd1033c4fac72883f0470c3e023b8c59075a779a105462f52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rivet_env::backends::production::secure_random(\u0026mut seed)\u0060 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_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":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8da282e85cd1fb17bffd977f557d9e7eff78de325d6c4c9c674d990a0e8dea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060super::Backoff::new(clock,rng,max_exponent,max_retries,wait,randomness)\u0060 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_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":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ce034b40b712766497ffd9f5ca3f4ac29417709d219f287f9b57060cb1bbab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.current_duration()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060current_duration\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc16b33421c00e3e047c0ee10fcbfec7e59b3bc2638a155183de450ad39e5ea0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.current_duration().expect(\u0022legacy backoff overflow\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 \u0060current_duration\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c41438deb518da9acd9761efee5c1c219501823cf735e65d2953942d5702c6"}},{"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 \u0060tick\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ac9c720326aa10f7e092e33b83c2dd57279cb99edb495766584f9e08d1781f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.step()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/util/src/throttle/legacy.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c458974df1a22abceefa708459f80495f013891415103b4ce1cf388b1604c7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Response::builder().status(StatusCode::OK).header(\u0022content-type\u0022,\u0022application/octet-stream\u0022).body(Body::from_stream(body))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060receive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/universalpubsub/src/pubsub/http.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"833d32dd48e01cc52e48a09570399eaba2729684428edd4295e89c4c065d816b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prefix[..].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 \u0060frame\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/universalpubsub/src/pubsub/stream/packet.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b962a4b6414c52d9a431e16db8c24a0165506431a79418ef1bc83466eaf0c11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060latest.write_sequence.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_renewal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a5a7bf227f4e8048b9b2f0c4c5947f9a0a7af65f05d8a962a999098bb986ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.discovery.round.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_list_storage_workers_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":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0797c99b5773f245ba270a9e4fcd8407f141a98584f8344d883d09c3e7e90182"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060unconfirmed_writes.last().unwrap_or(\u0026confirmed_write.write).write_sequence.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060begin_release\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lease.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"072e5176a748d898edd6b416022d9f0d8865d9111585ce27e7d72fc3c94ec58d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.lookups.next_generation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_resolve_endpoint_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lookup.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8626a8a6ef12ebfff0426552a28a1a7d4370f1d913e4e2aed4a92c98c6d48b19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.lookups.pending.remove(\u0026worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_lookup_endpoint_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":"engine/packages/topology/src/topology_machine/lookup.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fe2b9f98b413877c0dcfdd0ea2a11314bce0a01675370d03c28474cbcf825d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.lookups.next_generation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_inspect_heartbeat_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/lookup.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8764b96bd2809353162b97b0d31cd4405621548fb06230ca878152938e777f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.lookups.heartbeats.remove(\u0026worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060handle_read_storage_heartbeat_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":"engine/packages/topology/src/topology_machine/lookup.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4710f4edc661bde17dd7aaceb26a3c633ca8ab00bd37cd56ff26b159a2009f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.lookups.next_generation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060handle_read_storage_heartbeat_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":"engine/packages/topology/src/topology_machine/lookup.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"365790a9d52c68d20d1280b5d81645200353c6db9ccf95d9a67dbeb89546bd87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.watches.next_generation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060polls_due\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/topology/src/topology_machine/watch.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"27585b606a70e0bf196720ab8708ac4cdee55cf23339ecc926bd02e49ccb4ba8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060completions\u0060 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_with_completions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine-ephemeral/src/runner.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd242b45c351c18ad23fc6ecdd18e6dfb1739472b86020a2967d5473dc2dd450"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060run.armed.pop_first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine-ephemeral/src/runner.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"197a32c0aaccf6032f74a40350f11a60a08f1c73a6b7357bf684852d55c14f2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.entries.pop_first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pop_due\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine/src/deadline_queue.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c18981824c04418efbca3ee3fd276109fa62d8f8f0ee5d12d21aef241ac45fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060index.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060next\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine/src/state_machine.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"afca561b01540aebf3f59090d7a0e5ddddf6c670bf2fe808a42c157d432e8015"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.completion.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 \u0060complete_later\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/state-machine/src/telemetry.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14a037b45cc2dcf5c7be6dc0c6604439eb5632a5d4d2f15c171a320a31154fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060span\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\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":"engine/packages/sqlite-prefetch/src/driver.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c07f3f10ac14da5724634c6d1b14bcfb6284659cf2372b944d2f8090aeb0d7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.connection.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 \u0060connection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/mod.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cce7ae546c08b9ef82cb0d25fe44821fa6d0a85b6eb4e5b00061884f8d8844"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060statement.query([])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060query\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/mod.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab44d07c584659cf87219c22508208b14eeb8c75a51c177ee9c4bee797c5d8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rows.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 \u0060query\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d6d8aa1c00ac14bd8c34d97d20a147cd97ab60584ff46cce6499ef21a1d680"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row.get_ref(column)\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f9bbc1d7255bb30bd61ea659afc73afc093cf96bf4241793b0eb2444341f93"}},{"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.expect()\u0060 in \u0060live_chains\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ca02ce0e4957e77f61fb394856df313cd1585574eefd6501224c4c7a747cff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026path,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 \u0060live_chains\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa41003363813a2e913256ed168e29cf1e39ee408b8e63b61b98804c1432b10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rusqlite::Connection::open_with_flags(\u0026path,rusqlite::OpenFlags::SQLITE_OPEN_READ_ONLY)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060live_chains\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e40802cf3a6cd57b771217ee40f928840c74f4409f8c2484c91a68374dbaed2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060connection.query_row(\u0022PRAGMA integrity_check\u0022,[],|row|row.get(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 \u0060live_chains\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e31e97d79bce2c4df99841657ea0004e64a01dcaf4c7ac09c6064d2a754f132"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060connection.prepare(\u0022SELECT name, path, pageno FROM dbstat WHERE pagetype = \u0027overflow\u0027\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 \u0060live_chains\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"159340cd2ceede57b996877d0f88d0c015ebb69701ee2181a17c299c7ab36c56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060statement.query_map([],|row|{let name:String=row.get(0)?;let path:String=row.get(1)?;let pgno:i64=row.get(2)?;Ok((name,path,pgno))})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060live_chains\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a53b26fc53307a7c266e34c3fb4502038b9c66b0abb35a5f7fa7dbf2f86a79"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060live_chains\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0c22ab15ae3f7b824f1e28524d10fa9aafef33bde6e98043e57ed6e0b9b9b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::from_str_radix(index,16)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060live_chains\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/oracle.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e630bf0acb6f88da8c5e912f64645ff34577e4f5d167efca21a99cf6929588c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.prefetcher.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_pages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d042112cc3a8c1c7c72bb968f3caa022ba266e3d22753a386d34b53a6cb70f2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block_on(driver::read(prefetcher,self.store.as_ref(),self.request_id,requested,self.clock_ms,opening,))\u0060 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_pages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe1827c8bab82132de03b152bc31cb53bca4ab793db1fc4c4b6014728294ecb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block_on(driver::run_lookups(prefetcher,self.store.as_ref(),reply.after_reply,\u0022after_reply\u0022,))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_pages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"86862d09e8d3d65df5d0d17c7494a8f4a0b54cbb347897517123ebd3844c33e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.read_ahead.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_pages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7265ba794b45fe33a05208d7b30c0e4ed4d4d8cc09860ea676ba86e90a14d3f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block_on(self.store.read_pages(\u0026frontier))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060expand_overflow\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"296a8c1e2ee545d4570e83010493f77242f40d69d273fa81d29d9311a5527439"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block_on(self.store.read_pages(\u0026pgnos))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_exact\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b6643c91441101f8e422d9cfb6c07ff0affb9369a4b1142b079bc1732b300f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block_on(driver::plan_commit(prefetcher,self.store.as_ref(),\u0026builder,size_pages,txid,COMMIT_KV_BUDGET,))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060commit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/server.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d33e914e45cd9466841750d42e2bfda9da85c1034a9ed89ebfb5715adbbf63"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(format!(\u0022sqlite-prefetch-test-{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 \u0060register\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/vfs.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"495b1a7c84b0d7eb7da5668e8af9f5b295bd1a6309bbdc92959f3974e23a149d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self._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.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":"engine/packages/sqlite-prefetch/src/harness/vfs.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f16c2a86cfde444aef5cbbac191bd2fed053d6977ef9dbff022e84e0f6de9b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rusqlite::Connection::open_with_flags_and_vfs(\u0022main.db\u0022,rusqlite::OpenFlags::SQLITE_OPEN_READ_WRITE|rusqlite::OpenFlags::SQLITE_OPEN_CREATE,self.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 \u0060connect\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/vfs.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9115afb7a863724caf3d1daa2a1ee9bc1d0c44945eee4d07580088d53f1e4b0e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060connection.execute_batch(\u0026format!(\u0022PRAGMA page_size = 4096;\n\t\t\t\tPRAGMA journal_mode = DELETE;\n\t\t\t\tPRAGMA synchronous = NORMAL;\n\t\t\t\tPRAGMA temp_store = MEMORY;\n\t\t\t\tPRAGMA auto_vacuum = NONE;\n\t\t\t\tPRAGMA locking_mode = EXCLUSIVE;\n\t\t\t\tPRAGMA cache_size = {cache_pages};\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 \u0060connect\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/sqlite-prefetch/src/harness/vfs.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7792d3c89a84c66dd7391872001b441e36395a95a8fb93de5543d35ff3c5354"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060executor\u0060 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":"engine/packages/singleton-coordinator/src/runtime.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"51beb19cd55261960709ba9e69f37d57d9a8eecb3cbc8a421cfd1daf3243cd07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.runner.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 \u0060subscribe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/runtime.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9bd2ada5f1d4b73fbb7d4ca6ec3ab405b7c3ca5d2cf903efe78bbe99cd1ad2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.runner.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 \u0060handover\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/runtime.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46ddd13f948b8476e75d8c907ea36c21aa9b11daa60ffe2b89d7b5a155533be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.runner.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060close\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/singleton-coordinator/src/runtime.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f37104fab33427cecadaea70796deaaa8f849d427f4da5806b6f982fde43441"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060task.handle.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 \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":"engine/packages/service-manager/src/lib.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb9e3963ac7b301f0cc3e2d513c2f3407ab064cea9bd7ab16a53768f3e0d86f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rt_builder.build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70621632d2a5f52b62afcf446166081f1b4326d81ac0d3c24e5d0f5faeae4b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::LogHistogram::builder().min_value(Duration::from_micros(20)).max_value(Duration::from_millis(32)).precision_exact(0).max_buckets(20)\u0060 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_tokio_runtime_builder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe5f591d44a1fea3ecf804b20c0105d1b940d3a45cf0bca5a1a4a04ecff21e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060thread_stack_size.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 \u0060build_tokio_runtime_builder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93285fa7fe3e5e5d55695e3ed11eddc5ebd3138de41cdc275f60629774111a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060subtract_worker_threads.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 \u0060build_tokio_runtime_builder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c592a47c3bf9201a46d96857139d7eca21f4648e41c8c914832db0f9b476b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060max_blocking_threads.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 \u0060build_tokio_runtime_builder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31190c94c451b70b8f8906439b661d68694960e2204f9082517218622f1f1c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060global_queue_interval.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 \u0060build_tokio_runtime_builder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"579a1850e00694e111f2f8858a4dca114b3181296319f1447b8a411ea3a1f448"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060event_interval.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 \u0060build_tokio_runtime_builder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b2c9acd19d4a6c995ac1e3d6d60f3be31389e9cac6f3f1f8aaba5e930c4d38"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060thread_keep_alive.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 \u0060build_tokio_runtime_builder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6e54cf7cb3a782b1163f1491defead8e94b283d665cbfac0564a58e9745724"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060build_filter_from_spec(\u0026filter_spec)\u0060 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_filter_from_env_var\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/runtime/src/traces.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10094b8ce94fa1af06093743e6a23aa134e9b0542b7faa38cbe6d275d6f57e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060axum::http::HeaderValue::from_str(\u0026id.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 \u0060connect\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/routes.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c8af3747f1b5b1d3828f5bb79a8798a63117e78777de4c86f15d9719e28138"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060this.future.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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/sqlite/trace_scope.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c9256435b7bc998730a6c99032371026133c9a5f2c6f363d1f286cee1c8f3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.items.remove(index)\u0060 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_send\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/pegboard-envoy/src/connection/inbound.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de3fc959ca4fb398aeaec437500f81c677c99659d14c840fdd565bea717c4c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060opentelemetry_otlp::SpanExporter::builder().with_tonic().with_protocol(opentelemetry_otlp::Protocol::Grpc).with_endpoint(otel_grpc_endpoint()).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 \u0060init_tracer_provider\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/metrics-server/src/providers.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee04809221940357cf22f67f4e431ab681d9ee683d7c2d04ada675ae5602649d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060encoder.encode(\u0026metric_families,\u0026mut buffer)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serve_req\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/metrics-server/src/server.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9217c58a61d1998e0ea3eb16f4b039089f450746ebd03d279942785338133331"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Response::builder().status(200).header(CONTENT_TYPE,encoder.format_type()).body(Full::new(Bytes::from(buffer)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serve_req\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/metrics-server/src/server.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb738baa93c947aafb6c51c30c02d2a3e8b1810201c88f306e9977152614f275"}},{"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 \u0060key_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":"engine/packages/keys-macros/src/lib.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c512dc7c9f65447dbf50d9e598913bdbeb63157cb4bc1029753e2db3ac36ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.attrs.iter().find(|attr|attr.path().is_ident(\u0022error\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 \u0060derive_struct_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"475706dfb397d71e11c15cb3b4c89b42290f9312210198b7a7826561bfb31e8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syn::parse2::\u003CErrorArgs\u003E(tokens.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 \u0060derive_struct_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fee83891ee4c77aeac6c280ab326239da3b77ff02a115fc8616212d78f0bc9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.attrs.iter().find(|attr|attr.path().is_ident(\u0022error\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 \u0060derive_enum_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"685890629f1c5fdb812356b9d17ea429af944882dafd985b21302767b7add151"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syn::parse2::\u003CLitStr\u003E(tokens.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 \u0060derive_enum_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f982f930f59864b4276f6c9b800078d9031adf597c82dd36776ce1ad15d0de4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060variant.attrs.iter().find(|attr|attr.path().is_ident(\u0022error\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 \u0060derive_enum_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f9bbc97589786bccd8a959244e47ce6028baa2e7953b642af11a5211589b4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parse_variant_error_args(tokens)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060derive_enum_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/error-macros/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"df92e6162491b61a6dfdabb94177528c116eb8e8621452645c95febe8c30e3b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.result.try_recv()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060poll\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/env/src/capabilities/tokio/task.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3386a184918f61fb6cabeabb3786c596790fefc0f9da658f18d4275d33ac7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.headers_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 \u0060execute_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":"engine/packages/env/src/backends/production/http.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf97f7d8ab2f52ce1305622ee1243e21e7ae89b288a5c239e0e5f6b8592cf79"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.headers_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 \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":"engine/packages/env/src/backends/production/http.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c43fe26dfc1ec550864e2abb1094f88bb55829e08ec78401b7bc59c975d5a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.depot.client.with_volumes(volumes.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 \u0060depot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/engine-context/src/context.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f69916d3abee5ec3141b1ecfa6a5e5f92ee4820bf8d8a13d9ead572d39361bf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.next_operation_index.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060allocate_operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/durable-reconciler/src/core/reconciliation_machine/state.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"659c7fc4afa798321fa00919e3598e4bfbd9a64ed1ecae398aa18d5425221ad9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060IntGaugeVec::new(Opts::new(\u0022depot_busiest_tablet_info\u0022,\u0022Worst local tablet per signal; absent when no local maintainer is registered.\u0022,),\u0026[\u0022signal\u0022,\u0022tablet_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 \u0060worst_tablet_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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72ea52436f88b553266082cc27f3bcd5938b973d641c9884bb04cb7ff9cb824"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Gauge::new(\u0022depot_busiest_tablet_oldest_waiting_open_seconds\u0022,\u0022Age of the oldest admitted open still waiting for its reply on any local tablet.\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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6f84d78cf4b01340e244f98178c5c6ce0a6cdd2a756260ac09e90ddb227ea8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Gauge::new(\u0022depot_busiest_tablet_apply_lag_seconds\u0022,\u0022Largest age of an outstanding apply\u0027s oldest inline entry on any local tablet, or its wait age when entries must be read. Writer clock skew shifts entry ages.\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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfca831b09c2a1269414ab2dad7f4c58139f98a7394bf16df4ae6318c1a77ad0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060GaugeVec::new(Opts::new(\u0022depot_busiest_tablet_upload_busy_ratio\u0022,\u0022Highest share of the last 60 s window any local tablet\u0027s flushes spent uploading (upload) or held by a full level 0 (l0_stall).\u0022,),\u0026[\u0022phase\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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f41de9bf950e31c372596dd45d32a462de98171037449c11fe36bddb257db4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Gauge::new(\u0022depot_busiest_tablet_runner_busy_ratio\u0022,\u0022Highest share of the last 60 s window any local tablet maintainer runner spent on transitions and effect dispatch.\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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a1b647011e8a12b62a8cb9e8352c0e9811dc0ab071e0155fc68a920ab2909d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Gauge::new(\u0022depot_busiest_tablet_store_busy_ratio\u0022,\u0022Highest share of the last 60 s window any local tablet spent in store operations other than flush uploads.\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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d801d2a8c9526048cef2086de5395835bd43eb5c93039f5658b0495b8b0d915"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Gauge::new(\u0022depot_busiest_tablet_apply_rate\u0022,\u0022Highest filesystem apply rate per second of any local tablet maintainer over the last 60 s window.\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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"286f24e33b98baf212e59e20a6c5df92bbc4f31e2eef95ab0e4a0c3f323db1b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Gauge::new(\u0022depot_busiest_tablet_cold_get_seconds\u0022,\u0022Highest mean object-store GET latency, in seconds, of the GETs any local tablet\u0027s store operations issued over the last 60 s window.\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":"engine/packages/depot-worker/src/metrics.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b3db36fa942763815c1ad332c03d66e2a7e88fb0ddb943b8841fef46988e3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.running.remove(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reconcile\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"1185292128fb9e696ccda295ec20f2e7f74d9af90aa9723599e34b7762d757b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.finish(id,effects)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replica_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/mod.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9852daa787f22fc5912c03d17cd2db30bcc20ba64aaebc97e99e7523af8ef354"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.loaded_volumes.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.unwrap()\u0060 in \u0060admit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c43c802cef9fca97971631e67e426cd44e599c1e18e41fb7d0a3e4f384462d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_checkpoints.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a820f55205b7c40fbe55ffe6a320a8e65613fc21adad4ed4bf65695eab2a7cb4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_checkpoints.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f0c0929b046c5d06afe9ee89f709fa1f3dac49304c0439266fc16d7dad96f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_checkpoints.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b5dcb5a6ae0b1cfb1be989feb8dd3db5957ad4417e1d47f3ad0e91443db68c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_checkpoints.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee8edb4b6e8a2ff5a45d67cc4150a0113c475a19ea6003185613ddb60bce7e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_checkpoints.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/checkpoints.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeda0c46543dca29ee8e34b5e7e77a5ec99cc0c6a382f27417691980e3252aef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.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 \u0060dispatch_trims\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/cold.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47061c479b52264631ef777fd282b92e78b6bfd1e80b4f5c963fae3624cc32b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.deleting.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 \u0060resolve_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"279f0a572c7b8262721219be5f321d629c4b2ca3dfb9e8c2137b4a07e6a6fa9d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.deleting.remove(\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 \u0060resolve_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"665867d707a7555678b4110c55bef74562af30e79ffc05ff4c7890157f034cd1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.deleting.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 \u0060resolve_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19d67d7d93b2c7ed747c1d8776d1b93e5cb0866c4f35c5f07a542d55459eeda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060observed\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"326ecff0a9525dd53b5d44ec6a83b96ad0f2099e58bf4ee5e9c3e7157bc4a774"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060loaded_row(state,\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 \u0060resolve_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"378225226b46dfa5c83079bde45aaaefa7941afec6fa4bc9b4359f99197b6d86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.deleting.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 \u0060activate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfc089b8f9eb2837ce2e8e1d114b6f26b4bb483f4fd95f0826b1b31343b4c74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.deleting.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 \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e460e020cc1da075e3bde790fc752d6464a5e7617015fed5d25b863c51caf01b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.deleting.remove(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060advance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e239ddfc1e9eb9c9c37fb0777e55bebffe96963e12c66cf6e08d1ac1f8a6744"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.disk_incarnation(\u0026worker)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"d875b356c9f9fcd36559dd2bff7dac1f0ddfe4ff6e070d4628bbd7a14738bc6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.deleting.get_mut(key)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/deletion.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa53a969ea0005a102cdba3d8b165d763a090ef714e8de7f6baa563e1a638b8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.drains.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fix_tail\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/drain.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd52f23a01c5c827373d6a7421fd01d9ca182e82fb89e87041f0ed88d3394d1c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.drains.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/drain.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc367d0efcdf27678a4f7f124e1b091784eaac648b69a7a8f2ff4596d18a807"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.drains.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/drain.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"91daa564c428b13c4e5521878c0a00dda7f67678b448f57051d973f31ae819e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.drains.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/drain.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ade29f268313d95239466d7807fb7869cd88f3a2e3a7d719208a6476c3079c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.filesystem.volumes.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stored\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38c63db7841068a2500af3d1e15c7f6b88e1b790463949d6cb18a4c6cf8436b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.filesystem.volumes.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stored\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e13aa5186a01ce51bd0109cc9ee4ff81504f31e8895eae632a0a9d24ce5dbd7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.filesystem.pages.remove(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_apply\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fff7ba4d6141663b5762a2e0360209550d70574fdfdab9acc41706f6dea4a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060key.0.volume_incarnation[..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 \u0060applied\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":2047}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4f17d29abd6d079eee4110f356f919a9a5277872239adb4de56fe4b326ecc2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.filesystem.volumes.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 \u0060retention_due\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":3293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dda0eb243d2f256c88fd8aad8ea78efd38d6a68e99f55a3e5586b2e17512957"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.filesystem.volumes.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 \u0060retention_due\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/filesystem.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee925a41c45b082726b38b8f0ff333bdb4e06b792fd81ac7aac14558bffce834"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_fork_references.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060plan_idle_pin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"055ce02c6081bb1d595999701a72d7f6e56d5673e3e56b1fdee362d7ab597f88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_fork_references.get_mut(\u0026request_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 \u0060idle_pin_planned\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"64df797e95e284da3d52a075ade96359380a4959c3fc5f3695a6bcd42c42cae4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_fork_references.get_mut(\u0026request_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 \u0060completed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc4f45036e07feb0a7baf965e41e2e694e7ebe8b0a41f977f9ff2ff88e87634"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_fork_references.get_mut(\u0026request_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 \u0060completed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb8630eb1123afbaeee78a4fe89ef9ff2b748c5af877fd249f9e976a9d2b5a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending_fork_references.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/fork_references.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a14fd6749a40f07376bdb1cc18089351dfb2b24e03ad6cb6634572b54c73a22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060queue\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf51ee7aceaa2c0863f6c14dcfef2ca3c54d226f0a4690d7025375efdde91a2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fail\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf737b8aec2f5df5331bfe82a36877c0af2c23a3fa63c884c91a388ffa43c0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fail\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3e10282c67c574dcf5cdb3267ab548d8a707fa8391d229c5628dc43d63cb20"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.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 \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e735d8ad6a07cbcd71bdf4510fd138a4ef4e107f529f07749a03b0fc9c4b810e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.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.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf8437d20c2fc5da3b3085cb070420c4a5d35ed595ae61c270c365904152d51"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.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.unwrap()\u0060 in \u0060stored\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d54dc6af214175aa8d3c52040c810727ac64ea2cc28ce2080c62f767e814d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.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.unwrap()\u0060 in \u0060stored\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e78a0ea1b6817a20f2a5ada1da33eb9c803a0304cd88930e35266fb02f8733"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060refused_busy\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"016248e5e8fb23350a00bfbb0ad18d0636ff726f989d7053fffaff8606173186"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.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.unwrap()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7b17db8499145fe556a4f837320879954791c0166cb5c9dcb3fa8c8fd85a86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.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.unwrap()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad04cd9ed1028d66e25c4ff138de8bdd01c52738c89a479da478889eb186689d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060publish\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae56fad4adec394eddd42a94178f79dd25432d5611173b2dfb478f449b04c9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060log_restore\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"1975018a694cd710e1c056757883cd498e1f214a03729599371c6310c824534e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.remove(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060park\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"639fb97e511d3037d0e9f5be9883fd366c8b9082b66c37fb5f64462c50ecf44a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060wait\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks.rs"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b44e3b363bd8b0ef5a14545dd15ab9681565f943013c0ee46331b0a56724407"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.loaded_volumes.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 \u0060creation_expired\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73917431431588e8a6e36a17a3f4cc622a13c4ed76339def86a380282e53cd7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060volume.creation.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 \u0060creation_expired\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f26ec14176f1145c4d0f7a3aee964685bf2d1709ee607667ac1bed3c42a6e98"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.loaded_volumes.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 \u0060admit_open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"433a736e955c92fff8b6769d82008006077c2bd2cc5af98087ede91f7771e771"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resume_after_repair\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f932dabe260ab38c235ccd0fdc544d4b7c8eb46be6f0d38ee05177e14a41ca9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.awaiting_deletion.remove(\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 \u0060resume_after_deletion\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a6c543799da95050e4c05cf4caf0f53f148d25ff938245cf3424e817c4aba5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"484866a0800a2354ead60d77d942878f602661ebf7705436d2a542c78f72930c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc748ef02cb207dc14b6e6ed94a265db37023edc7038e26347a0c50035aef3f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"37540bb0284254c47111185b848c8446276b3c4f52ed335aee40928d6ce09ed1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"b234d4755e58ec8f31453bd7ac8816dbab388b3dfc781910359b83aec491264b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fallback\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e79ce8c13741f1be45f38d48ded447f9fb415f7645ccbdaeab73a6a97d3ea3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f01e62d06b9d32f5437f4f8f42f804839ac6808855b32125610d85aedf498e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbbedc1cbff213612d42bba7f817a98c73b446bfd5a2cd36c666bd8121ef1f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cceb9ea8e0a99fc3495517d4027c788055c1ee989461be283f4904e5fd0deb7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"9860e7dcb81fdfb4d943b7b9ac805909105241f3e6308b1d4c08b722daa50232"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e578404efe974745233b8bec2d9a5233d7e27dc8ba36b4e9ade5ba02f6da90d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e3081446902da84ea37ab7ab943da1e1ff4677aa2a5c19fb8b8ead0aa5560e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cc5afe658dd538185ff635025644316018ea0acba2b3a7a910ce4f9ec6ff3d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.loaded_volumes[key].creation.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 \u0060grant_creating_open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aa1f78093b785d1fb008a431b6b71178a89a0c76ff9c9d2fb9af6c4c5bf2e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\u0026volume_key)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fbe7d942b11c0df45388a5d27ea55fbfc0bd2c008c04ff727305453bf38f71"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\u0026volume_key)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7c196fb03265ca47fb7e6cd6e5826d5f382c45ff9f26a97de2218a3df86863"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060take_pending(state,\u0026volume_key)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1530c3df969db123a2e229d06d9badbe6525e43a717aad43389fd60cb96659"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending.get_mut(\u0026volume_key)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"be970e3a40dbb73e5286ae67d6b87365ed4d4544663050921e17a10df55dff36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.disk_incarnation(\u0026worker)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ac9c7b0a1b007831eeda62ad4d9f644d4bea6e9c3d9909dd005e210e4933b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending.get_mut(\u0026volume_key)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f4832b7ec642c62100afc6e1af115e7f0cb2e81a7b2390431fdf810f0d6a16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending.get_mut(\u0026key.0.volume_key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060loaded\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b0eca8312f1e93e3b1e00952972de15d891b52dab1bca192f4b999331de07f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.pending.remove(\u0026key.0.volume_key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060complete_load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2408d6fc7ce1dfd609fcbc7dcfaf1632e42cae651a901f9273b0c26aa2b5ed3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.loaded_volumes.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 \u0060complete_load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34ed9d46cb896dab09f75826ca3362e3867db8c3b19a7b2ca7c181b46fb5680"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060volume.row(\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 \u0060complete_load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/lifecycle.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f8ae6b7aa77d4dc6c09d3b7b55821dda1867378bab0e2f6dff7213af00b641"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/members.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cfc53bb8e17623aede68d1d02f2413ade7db8f310453c7ff045c39f290fc3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.next_op_id.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060begin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/mod.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"a056ee13fb2e2c76e96f6178565456df1e2c2c8ca6db696d96993d46f3dcdaf7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.tablet.maintainer\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/opening.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc8405619d8fecc5f12e96271311c87635cbeae4b43bd2254ab8bed92cf5ec8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.loaded_volumes.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 \u0060expire_all\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/poll.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db8e7afca4573545306092526398ffbc5b7406b1a98e6107a2f4f32f62f2062"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.retired.get_mut(\u0026id)\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"542fe6769a7de88e76456142f1ee02a6dff46411efc707583086b5ff91aa5ecb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.retired.get(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c08ed61ccca6c6de2db85bac553e3ba9332806f13a22f711f27d6a2d6152bfd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.retired.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e4de73bbf0d1b1ac11ab58c8947f0e21ea05de7cec5dc18705333e3e598c84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.retired.get(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b707430b30984f4b00c823d7d483be3bcf315a86f6d4ec7daa91297e0941af6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.retired.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d672ff4e2fda52c282ab477d257c187b2118a60abd7542681a20ef5b0f1a6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.retired.get_mut(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc35bf543bfcb69673910099c7203e470d00f8d12efcb884c2caa4d44a519cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.tablet.maintainer\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/retired.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a00bce98d601d078244160857a40ef356b8d4ca893d35169d25a6d9bd5d5c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.tablet.split.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 \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/split.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ddfa0f2283ac7ef8d487493914fb8a8d6ec3fadac4734f403e5ce9ed3d3f61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.alarms.split_manifest\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/split.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0c3d74a3bb59acd1534971eabc21dac669c31f4b5b3e167c47212a3ab78347"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.tablet.maintainer\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/split.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c269b7a88b824e23dc6c4e6f03cccd9794aecc22cb8aa05eb8fbb08f6669738"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.stop_checks.startup.pending.remove(\u0026old)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060admit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/startup.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe129ed258d0a9782910564a5549ca01b52001ed0f94a536e1b6b211abe3c88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.stop_checks.startup.sessions.remove(\u0026worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060completed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/startup.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf4167a06be3a8a779f4dba3a5810999eb57b01465b6a3ac3a1653f10159e0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.stop_checks.owner.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 \u0060handoff\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2654902c8ba87d99afde847bef885c48771d0f6657df214a7eba20cef21b6a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.stop_checks.owner.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 \u0060handoff\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef32c530d0019aa706aa3cfeaadcadb13fb6d45e7b606de4a4817bbfa3eb5c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.stop_checks.owner.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 \u0060handoff\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3e66c4ce0ebe2779f66c51305b8e8485295dced91b3514e984192fc876b1a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.stop_checks.pending.remove(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060completed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/stop.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7a486d401135a866160433e483368fb45f2b83b11d51933771a43d20e97d4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.unloading.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 \u0060drive_queue\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/store.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4552945b939ea5c4de40c808438a2066c719416a710fb16583b1cdeefa099e92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.unloading.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 \u0060begin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"348fd12fcbaf82a52dbeb15994622bcab088bff95aa22b5570247b22780fbcad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.unloading.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 \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8fa674fb97d041e768d7318f0cb1c5863b61aa772155b1c8bf60fb4fa51231"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.loaded_volumes.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.unwrap()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc0f61a680f89df66f6df9627184b2b40b303cf83244be51e31e842fceb7afe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060batches.remove(\u0026worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb0c52a18973c37c765e42da97e97159abbe903fb83ee06e4d7287de5691a6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.unloading.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 \u0060members_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/unload.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"289723609aa6fbcc9a981640777dd069466ee37ee0671fa01314238a4879248c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.calls.active.remove(\u0026operation_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 \u0060prepared\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/calls.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf4138ea1f2ad6ca59edf9767ae74600246ac6d75fd348c45ffa2e51513749d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.calls.active.remove(\u0026operation_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 \u0060audit_applied\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/calls.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffddcb1162bb9be8a835dc41c6910f40b12dc85c8cbb7fea284abbe5ac24f06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.claims.by_name.get(\u0026volume_key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060opened\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f42f5cd9ee758074fd7fa98c62b460d858748db8e4d24997a49f9bf287b8ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.claims.by_name.get_mut(\u0026volume_key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060opened\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5961cf5548940013f1d6a8c152ce082b5e76e81a389f008ee7e3ec8d71a90d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.claims.by_name.get_mut(\u0026key.0.volume_key)\u0060 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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f66ba365ec9db0fbd4230451d9044e35ef7679c4ec12231f71a2b2ceb73667"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.claims.by_name.get(\u0026volume_key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060appended_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2c5c559fa6c7f02495ebdea66e78b3de574ead6d6715205e79c5a0950a107b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.claims.by_name.get_mut(\u0026volume_key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060appended_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"8490889806ec1fdb3c4af6ffebd76be19db64ce6baa9ca6a35272984c0120553"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.claims.by_name.get_mut(\u0026volume_key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060appended_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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4586edc407e8d87dbc3723531ca4cc90aa533f3c858bf34b22fb37e5979a2e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.repairs.claims.by_name.get(\u0026volume_key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060timed_out\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/operator_repair/claims.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe02f90e0fb1ab74d6eb2ddd9fda2cd9e5d88fad2273837b51c8a0b694da56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.maintainer_log.client.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 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec172577c4fccbf5e315293c3094ae2edc76307c6e2b580f5ccc38c4e8e9f29"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060log.client.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 \u0060advance_member\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa273068a6cc53ddc77b3fc85539b5dcbd17162f2b065ef63c4af76ad0192c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.maintainer_log.client.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 \u0060read_tail\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/mod.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"872beda74f58f43897fb44acebdcc94a32609cb6c9b010126028307d08bac4d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.maintainer_log.replay.by_volume.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_ready\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/replay.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"924ae6de737460228bdfe60c20e59592cdb7bc240d90bab278955e176eb722d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ops.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 \u0060dispatch_ready\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/maintainer_log/replay.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"148358028c49a32f504c54adce7cda2b9ed64a5f5e81b0c59d67a66f2ee8cf04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.forks.jobs[key].spec.restore\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060quiesce\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/forks/restore.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b54d79f5de8b13417ba39c2b5eebfbf2423ae45cee04dfa25e957d193498515"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.disk_incarnation(\u0026target)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"338d800e750211d20f11b590afa0f1f343587500f7943000528a2da06d6c67ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entries.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 \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":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/mod.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b0c63594eaa6425f29b998bbe8761e6a3088c5d126b302feaf16bcd95bab61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.membership_goals.get_mut(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060recovered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_maintainer_machine/state/catch_up/progress.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f12ce5a0ff89c412f168130bcbf16226f4b0c272367f022313b2423e3991542"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.next_operation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d11ab808af28ede3176f71e7d7480de131e40b634b697b1ba8f50df2f77cc77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.queued.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 \u0060drive\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"181a5a16ece53c29e824ef6040f2cbf33e814a4c91fc9d6557f9044c86a4d58f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.queued.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 \u0060write_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":"engine/packages/depot-worker/src/tablet_coordinator_machine/state.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"369a1bb44a7fdd887f337c20f7ce0cd452ff33b97122675224c2bff7b5138d63"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.next_operation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_balancing\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/balancing.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f2d7dabee24b5991c82d0d7192f8a38120f42ebf2010eeb6ce2431ccea2ab2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tablet.maintainer\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_grant_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/handoff.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3848937ec5090ee0d851484eb230d381c7408ec336c0a5bb75bf43fdaca71b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write.manifest.tablets.iter().find(|new|new.id==tablet.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 \u0060prepare_grant_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/handoff.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45e9f3da9b528dbdb6d633eaa26fa008da065244c51bf91ddb62a52c963aca4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.next_operation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060check_handoff\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/handoff.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b7f6a951c796b6b57c7dabd8222e966d82d583f45f6e1792b4450e9d6d67e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060next.iter_mut().find(|id|**id==request.leaving)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/reconfiguration.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9d12c92dd7535dd060613a03d25d404f498686271c2784d78f594304e08b52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.tablets.iter().find(|t|t.id==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 \u0060request_stop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed81cb3c1782e42156c41bb2c6555f824f6891a1c41ce11a8b19fe0d6a30f4d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.stopping.iter_mut().find(|entry|entry.worker_id==request.worker_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 \u0060request_stop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeddf9ffeaa7a84762c14d02ac97a3d390edbb5c18726e690ed41c91b10b3b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.next_operation.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stop_confirmed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/tablet_coordinator_machine/state/stop.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a288004f2c302b7de921cdb46fb3fc203f06d8430e08d59d4aa43a72b9bff4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.timer.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":"engine/packages/depot-worker/src/services/stopping.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdb1db1e9235e2f62210c34d71432ea4dbbcc9e73a2420bf4a50ffbc60993b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060retained.pop_first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060retention_updates_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":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6b193542320a142ec2aaeb9782a2dfcfb5e02065381addb7b6d0168a72373a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060retained.pop_first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060retention_checkpoint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/checkpoints.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"40407c2a6d0a53d568cafa7eef48b6d9a681756ec327f9305a23c8989de2fb6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sweep_locked\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/filesystem/store.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"210bafba4cc91fff0499b6b4fbe6e73667d68a7ab54f6d5270045bf42d0c617e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060admission.opened.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 \u0060execute_with_writer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d43d0125ea92e42babfa886b6b817b2d5f1ed4b7311ac65f9dff5fcd594e671"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060admission.opened.as_ref().expect(\u0022active admission holds its volume\u0022).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 \u0060execute_with_writer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-worker/src/command/volume_host.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ca0275318753d6d30cb4e547b03a646b1b81670799f9fcd3589bf627ca8e37"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060send_to\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"164f15abed82be88b1616d80f73aecd6bac087172eb9e4610278686010534e11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.next_op.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe304178b93774fb2c1aeadf84db1386bf9b6b4473789824127cf86b35abf7ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(\u0026worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5beadbf87c9e372116b465f8a3e2be5ca4d6fc352f64b4b23140104fb20bdd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060retry_replica\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b5b6cb2857738a85445402c1d1417f912e80c41c17f529346070327de9e003"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060refused\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a18086b4c0b1b8335bb070859199384a11e93ece3d42ef28446c414b807892"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060too_large\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4546d5138b6810f5d15d29345930bc8c652ae78427369aebd3856e8f36e9489f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e567eb7bb784cc3701e6955af8f687e2b853fcfe84fe1fe16e72579f25bc1b9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.writes.remove(\u0026seq)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fail_blocked\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ef47897dee941b3040c319f8f3d8b55c8d0220117701b10263b7314aac160f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.barriers.remove(\u0026request_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 \u0060fail_blocked\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bdf08e5055561ac6ed01ce39298df9df26eba5374e3d2ed0597ec6f760f27b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(\u0026worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060announce\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/pipeline.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1e26a2003e7f4d023ed41530dd514c6819247f351123f10221bca5e7008cfe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060counted.iter().max_by_key(|(_,p)|(p.appended.client_epoch,p.appended.volume_seq))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060begin_recovery\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff36b0999b82b387e9d225149e9ca3b5409fc94b738f2a8462565b9a3e0f191"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(\u0026worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060claim\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffa4d9bf299de00546b24d38829aadcc7a92d35c208fc46522f2c2ba3666203"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.position(at)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060probe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d802c17cb657f7d1d3eb474e5bbb9f6edc0ee9e52dc3f9af0549e12483cc07d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060probe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"019ebfca70b81e05457067c61eb1237bc22cc9ab319f810806d6954f76b32d80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060cut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"891acb6722aa1c38345823d93055b6af19f77f7b9a2f26a885b4a65e9e45dd4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060matched_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":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"84799d20c2d9177db8cc52c090ac0b4f8dcfc94551589491c52b1b977cfe7bad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060copy\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15fc86129a2f00494dd7bfe8a807191a89b198d3d0b73987df0bb28a9e99bff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060copy\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"011f47514bc0dbd9e80eb66bf4c7c4adc03c8b3cace0f2cd9e9c88334d825c6e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060matched\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd5476a4fb479fddc9fa2c49a4985c82b9cd4bf4b38dc23830dc60441e13161"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(\u0026worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060created\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/recovery.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8b04fd73edad82249c37f2f208594e7e581e74ef8431167e3146f3ff39c9b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060backoff_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":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1612b32e5fa05b1ddd9ed462f66360b2dc3f5e7a8200027d6a3379538c11f71b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9c2e6ca7540a88691bd112f0b2c8c0860e0ec5c6b9823afb89dc592fb122a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(worker)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060too_large\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f2f956aa6c1d1a9a42d2b6d68bf8c36d6ae97220e82d9dbf5e48e14d31c2e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(target)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060promote\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1f754f7883b72a71f7e01f6298c224b770d2d5f4da718ad03a2ee199ba90ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(\u0026target)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060expired\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"518d37c403a211f70caab88c36deac9af56a77ebdfd49719e527926a0045cba9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(\u0026target)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060expired\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d158077a122d95b148a5af6aa3d702e4a28b8f5cce9e82a3c46c6dd82be783"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(target)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fetch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4bf8d32239ccc6827bccf0a156870572ebe454f6f77cdfba9d9dd778ae8d47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.replicas.get_mut(target)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fetched\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/repair.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f85bc4760dfbc2b8b4802cfd6b03021338750242f1894bd2c56a0b9ee0ca2ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.writes.remove(\u0026seq)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060completed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/requests.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc945914b12924b689738ff19461c3bbfb1f914992ea2de71ceaf645628b74be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.retained.pop_first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060release_committed_payloads\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/retained.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"341a616de493fdefb7d27a5cfa9a946912c9a8acf5a4271efa99635f25ccd81c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.handle.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 \u0060handle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/runner.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"650212bc8c9083b42a7d2eafe4b2121682b026663ffa9c0e06a29ce9455785d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.next_op.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060operation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/state.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e6f5537a9c77d8729e3e2b93079bba134d089a88ab0b22d416363d11232e13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.waiting.remove(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/volume_client_machine/waiting.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c7a518478e51115906671d1346a8751da97629a4b145d3dec0ea5d3926a263"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.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.expect()\u0060 in \u0060request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-volume/src/ups/lanes.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8852bb13c6d54135ce9fa0a1b3b7c7df1e4d4e239266cabb47a05502931c46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060end.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 \u0060split_snapshot_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":"engine/packages/depot-types/src/keys/slatedb.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a63bd6454b60125d468963731a34734c070cdb9b6c486d73c97d575b9ec56c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prefix.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 \u0060family_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":"engine/packages/depot-types/src/keys/slatedb.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59f6a784d98a7b5c8474ab0e993db0c804b6b55ad415cfaf0bad37f58841256"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_bare::to_writer(\u0026mut count,request)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060request_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":"engine/packages/depot-log/src/log_shard_machine/state/manifest_wait.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3862461c9f0140f868774e29f8966b10cef7222c7ae77473449f90e417bd968e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.manifest_waits.remove(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 \u0060resume\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/manifest_wait.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"882f0c33b43f44e34874191695605eafbb9ac2cb832dd227408f5993166230a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060batches.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7a33b6b7060d6c70a3a2bd5b418040d3a6888c2a736701cc9596c8dda20609"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060batches.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 \u0060dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"602c827c2db58d83199ee6637775bc14e5e3c98ea40ccd6ad0cf49ef56f45d76"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.memory_batches.writing_to_disk.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 \u0060written_to_disk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-log/src/log_shard_machine/state/memory_batches.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0097752a59065a999b7b2cd4eef6a47ca33f0411c044ef716e95fd6de6088661"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060id\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-fs-core/src/txn.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a7a6fa8218e780f2e39a37b2be4e0a923e1832f2d98dc6dd486f284a7d71d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Arc::get_mut(\u0026mut layer)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060staged\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afc25afae4e7af16c5d95d2fb0dba13276f800af397b3cce1daa4d23a68ff6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Arc::get_mut(\u0026mut layer)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060indexed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6de30cb1fbe46f466559e18a9797355aedd29b51d9ca04673496c63b3fccacd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Arc::get_mut(\u0026mut layer)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060index_only\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe8647e0f53f47cdc1f49e9fc22c6075c52f3d3caa0de3fd843c7259a981aa4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Arc::get_mut(\u0026mut layer)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060merge\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c23b1c52efac07e0a2da19a8493416488299d66a3db585bda5fc4f987e464e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rows.pop_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 \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":"engine/packages/depot-client/src/filesystem/cache.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff42fdbee1d54918ef28a0f1091d3805bb999c5d4fd0a46b099ac782000ee330"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.schema.object.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 \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":"engine/packages/config-schema-gen/build.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6d650e619505bfbcec4e508d9fad372e77ae149d3aaf108af766a7758e1dc4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Path::new(\u0026dir).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":"engine/packages/config-schema-gen/build.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c531a216b2d8e4e8764755c5ba99fe14c67b2988b893bf14382efb3b5ca481"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Path::new(\u0026dir).parent().unwrap().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":"engine/packages/config-schema-gen/build.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff814d55c0e82b424589c19362cebd116ead489142b52f467ef4bf5423adbba5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Path::new(\u0026dir).parent().unwrap().parent().unwrap().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":"engine/packages/config-schema-gen/build.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a14e538b3cbb50437d44e083f73178b81cb7ea655b9cba42bf5c350c95017eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022CARGO_MANIFEST_DIR\u0022).map(|dir|{Path::new(\u0026dir).parent().unwrap().parent().unwrap().parent().unwrap().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 \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":"engine/packages/config-schema-gen/build.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f356579edb68a71a66ac2fcd14cd61ed3ea40b0494adaed5c24e90f592556e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(\u0026out_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":"engine/packages/config-schema-gen/build.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7afc0ebc8e896dd604a154d88145f3eaedf153d0f3c3c5d0dddc061dd2dc505"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \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":"engine/packages/config-schema-gen/build.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23be12fb8fa5b416f2badf07c199dee83d579747998e202051bc99a042af413"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(out_dir.join(\u0022config-schema.json\u0022),json)\u0060 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":"engine/packages/config-schema-gen/build.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73679db555ba8d8fa8cf007a93b6954b8d9b946bb6f0542cb8cab9cc05045c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.auth_required()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060auth\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/lib.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"093b53f9c37f6c2fe592b6e28071ed97dab7cdd433624442a453c96d41f3e88e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Url::parse(\u0026format!(\u0022http://127.0.0.1:{}\u0022,crate::defaults::ports::GUARD))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060default\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/config/topology.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabf7840ea1d00d68b5b0b6adfd46a13d761f3040b7ab7c5f08881b7412665af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Url::parse(\u0026format!(\u0022http://127.0.0.1:{}\u0022,crate::defaults::ports::API_PEER))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060default\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/config/src/config/topology.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8e9efa877dcc2dc5be977a720606a2ac3dab13752272b2d2293ff7aa004c14"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060executor\u0060 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":"engine/packages/cluster-config/src/runtime.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0b7a36ca7fbb29f50b76af53055eae913941a7ae291913369ddac3ebd75d61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.runner.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 \u0060subscribe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cluster-config/src/runtime.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4b79672dba49a5e8bc64a3667ab07062f1ed7e7e00e25091b4917ee37f7bfd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.runner.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 \u0060refresh\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cluster-config/src/runtime.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81953ac8a5eb21cd8c7952876c8292c603e11134c4d531e97abbca295cdff02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.context(\u0022config runner ended before completion\u0022)?.result.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 \u0060completed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/cluster-config/src/runtime.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb4c8e32dc73d6b54f8892c3acaae125570361add5dfa6f4843cae088904ee3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060executor\u0060 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":"engine/packages/auth-jwt/src/runtime.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5feed3c3d118236e66fd807cdec6d349ba27bccd3597e1a193a30dddb10cdc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.emergency.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 \u0060transition\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/auth-jwt/src/key_ring_machine/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"926abe0a487256184af5c115c03c9d4d2f0b28a7c275a01a70b0218572e9868c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060openapi.components.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 \u0060modify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/router.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e53ac7f373d3ec0a535c279e41329e9222d87a1bd57414467d76a9f5f5f1f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.config().dc_for_label(dc_label)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/api-public/src/runner_pools/list.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef0d07501fa84095cd53f4c981080163ca4368b1cd69766054438ae5cee44a6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060changed\u0060 turns every \u0060Err\u0060 into \u0060false\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":"engine/packages/depot-worker/src/tablet_supervisor.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9f4554472f8879ded45db1f1ce46b4d5f1eeaa359e802e56fb6e1b8050d357"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060otel_grpc_endpoint\u0060 turns every \u0060Err\u0060 into \u0060\u0022http://localhost:4317\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/packages/metrics-server/src/providers.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55a1123419cf880c9bc2f70caa386f5c26d0560b71f400b9a25451d1e9fd31a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060legacy_actor_id_label\u0060 turns every \u0060Err\u0060 into \u0060\u0022invalid\u0022.to_owned()\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":"engine/packages/pegboard/src/namespace_machine/executor.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8904f715751a280cdc402d07f1c82b33a9b3a474f140ece3b3654ca6f8ac31"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060send_initial_metadata\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/sdks/rust/envoy-client/src/connection/mod.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeca6b21051194d5479e8337afd44644e7829ee3a08926fb0499fae12a2a5b1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060admin_token\u0060 turns every \u0060Err\u0060 into \u0060\u0022default\u0022.to_owned()\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":"rivetkit-rust/packages/engine-process/src/lib.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7dcfef7478a2f6950aed75718c0caeef0e07d2b7e01b72b3597b449a037a5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060decodeStreamCursor\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/workflow-world/src/index.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e6fb87943b12c77e1fb43f86ab4044ea2f3b0460b16328343edbb60d57e3bf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadDefaultCatalog\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/src/lib/version.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2293ca5c1288138a499bef3f996cbf8101df0faacf76c072f450ae2e3613f69d"}}],"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-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-22","guid":"b68d9ca7-bdde-d057-a6cc-9f8b1e739552","name":"Improper Limitation of a Pathname to a Restricted Directory (\u0027Path Traversal\u0027)","shortDescription":{"text":"Improper Limitation of a Pathname to a Restricted Directory (\u0027Path Traversal\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/22.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-321","guid":"0ce564a5-a44c-3358-b3db-317712e6e019","name":"Use of Hard-coded Cryptographic Key","shortDescription":{"text":"Use of Hard-coded Cryptographic Key"},"helpUri":"https://cwe.mitre.org/data/definitions/321.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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.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-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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":304,"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."]}]}