{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"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":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXA1","name":"Runtime unauthenticated reachability","shortDescription":{"text":"Runtime unauthenticated reachability"},"helpUri":"https://codehealth.canine.dev/dimensions/AXA1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXH1","name":"Runtime security headers","shortDescription":{"text":"Runtime security headers"},"helpUri":"https://codehealth.canine.dev/dimensions/AXH1"},{"id":"AXI1","name":"Runtime container hardening","shortDescription":{"text":"Runtime container hardening"},"helpUri":"https://codehealth.canine.dev/dimensions/AXI1"},{"id":"AXO1","name":"Runtime API surface","shortDescription":{"text":"Runtime API surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXO1"},{"id":"AXR1","name":"Runtime accessibility (rendered)","shortDescription":{"text":"Runtime accessibility (rendered)"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"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":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"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":"robotd::control_loop (cyclomatic 294): robotd::control_loop has cyclomatic complexity 294 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150e960272ca6f47923bb4b665f0b155a4c0b462b005fdb529cc487dc25e18c"}},{"ruleId":"D1","level":"warning","message":{"text":"Brain::step (cyclomatic 152): Brain::step has cyclomatic complexity 152 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/brain.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"098d475a085afa8320b82828c266bd985d068954c4c9151b832653ba944a1ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"duckctl::run (cyclomatic 92): duckctl::run has cyclomatic complexity 92 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/main.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9fc0b5e2462cb539f985b1f7fcf91171c7a80155b42ecf0685ed675d2ade4d"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::configure::run (cyclomatic 68): robotctl::configure::run has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/configure.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4bce6f223ab1be138a37a6e94fb91fa4efb5f0e24c43870081bea1b2faa0ed"}},{"ruleId":"D1","level":"warning","message":{"text":"autod::drive (cyclomatic 67): autod::drive has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/main.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3311fdbe0c2c551577459e779623de1e110664beb0192ba4541f8ddc4e5e6d6"}},{"ruleId":"D1","level":"warning","message":{"text":"robotd::dispatch (cyclomatic 67): robotd::dispatch has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":5853}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f08b578a02fe9a89d186198e1d49341d0d08ae86772e21a77c66571372491b"}},{"ruleId":"D1","level":"warning","message":{"text":"Server::dispatch (cyclomatic 60): Server::dispatch has cyclomatic complexity 60 (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":"updater/src/ipc.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5030b45b55d2253908eda8bf68150d363e8148b4618d88605428e9638d1de0f1"}},{"ruleId":"D1","level":"warning","message":{"text":"duckctl::udp_pad::run (cyclomatic 52): duckctl::udp_pad::run 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":"duckctl/src/udp_pad.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d41cf5cb98c1dee05c38f26b634ef348c2cb86f66ffa4dfe4ccf76f68e2539"}},{"ruleId":"D1","level":"warning","message":{"text":"duckctl::request_line (cyclomatic 49): duckctl::request_line has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/main.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"08718d603cf9afd7dc16ebca6527d051cf77eeab0e88084cff48863a1bd1438e"}},{"ruleId":"D1","level":"warning","message":{"text":"netpadd::serve (cyclomatic 49): netpadd::serve 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":"netpadd/src/main.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4484a43dd9f692af28899c65454b594c5a0b32875d1ffdb6318b6e88af2fecf2"}},{"ruleId":"D1","level":"warning","message":{"text":"padd::main (cyclomatic 48): padd::main has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"padd/src/main.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ffcf60dd0280da04a15fe65030c3c2c2316ee7c40a3068e289b876da81cb0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Tracker::tick (cyclomatic 47): Tracker::tick has cyclomatic complexity 47 (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":"robotd/src/vetbook.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bde535513f52b6768cb146d0d6c409699a0da964fe7d200ac2bc0d2ddf910f6"}},{"ruleId":"D1","level":"warning","message":{"text":"mediad::main (cyclomatic 45): mediad::main 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":"mediad/src/main.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fc1b120b5aff9b80a8b7a9431a6fbd36d3c05cf7ca94d9795d61576fbeba50"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::run (cyclomatic 44): robotctl::run has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":5828}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fef62d8f3dc4c48eab688b185d7f7392027a9cf067fcef0362cfac2c0c5a3ce"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.onSignalling (cyclomatic 42): index.html.onSignalling 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":"mediad/webclient/index.html"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"621b867dd5155a0471976872083719a6cf6f53f53edbc74190fe085686325197"}},{"ruleId":"D1","level":"warning","message":{"text":"Controller::step (cyclomatic 41): Controller::step 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":"robotd/src/control.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c1b12b5090477e88515656ef98c21fa8d1f34e9d485b8a8b9aeabb2132aeed"}},{"ruleId":"D1","level":"warning","message":{"text":"cards.card_for (cyclomatic 41): cards.card_for 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":"spaces/vetbook/cards.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9ed001946230f91227479a264351e713c73c0a007e28ef83837037bd526d6e"}},{"ruleId":"D1","level":"warning","message":{"text":"Mapper::tick (cyclomatic 40): Mapper::tick has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pad-map/src/mapper.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"43581e46a24b56ffa001fb398f8b68bcc3cecd1fc0ac5e64b623c4fed107279a"}},{"ruleId":"D1","level":"warning","message":{"text":"Params::validate (cyclomatic 38): Params::validate 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":"robotd-params/src/lib.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d58c2cd36be3c45da2a94e97044c1fb218359df119d971a6115d1658c027a95"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph::solve (cyclomatic 37): Graph::solve has cyclomatic complexity 37 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/graph.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff026bf4858f7ad2f256bae98a6ffd4610c0e35ce03ad1c7f86e9895443d1488"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::configure::draw (cyclomatic 37): robotctl::configure::draw has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/configure.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf506865dd2e3f30c38e09e6e3022e10a259d95280b60a318c4422bf24f57e71"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::vetbook::live (cyclomatic 37): robotctl::vetbook::live 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":"robotctl/src/vetbook.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5e1e69587303ccbad7da6625ad6ed34dd835a6cf33b3ac23fb63415016790f"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::render_health (cyclomatic 34): robotctl::render_health 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":"robotctl/src/main.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4b7e943afb92d5fbd006419a425ad81443e36b547d894bd4be02cde3042121"}},{"ruleId":"D1","level":"warning","message":{"text":"Brain::pick_next_state (cyclomatic 29): Brain::pick_next_state 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":"autod/src/brain.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59b0bac0da452567611c7162b33a799eceaa4887e011d8424ed41fb0cce8e69"}},{"ruleId":"D1","level":"warning","message":{"text":"sounds::chorale::midi::parse (cyclomatic 29): sounds::chorale::midi::parse 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":"sounds/src/chorale/midi.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0beb4747b0f5574ea1b73e5d9ddf8d5a21cb8cd8f80428bd83bec10ee0a620e2"}},{"ruleId":"D1","level":"warning","message":{"text":"robotd::handle (cyclomatic 28): robotd::handle has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"043c178a28f6de1b3dc0bd6dbdaf7b6fd2796c0178b7721a1c6e6d34b3acba3b"}},{"ruleId":"D1","level":"warning","message":{"text":"btd::secure::run (cyclomatic 27): btd::secure::run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"btd/src/secure.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1fdebb2715b725302623a9ebf9115b4bda8663c9e74279c6e259f900bd0a86"}},{"ruleId":"D1","level":"warning","message":{"text":"duckctl::udp_pad::panel::render_robot (cyclomatic 27): duckctl::udp_pad::panel::render_robot 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":"duckctl/src/udp_pad/panel.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"019b584ce3b4e5c45907bd14d1e67aec0eca7f557f15bb447f2d3aee60b46dc4"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::run_policy (cyclomatic 27): robotctl::run_policy has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":4353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2e974c63493730069ec170b1b34b8a895b2ce70687b2f6fa6e981b6a414485"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::monitor::live (cyclomatic 27): robotctl::monitor::live 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":"robotctl/src/monitor.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"204e6ec00f79a53b487e85b67d13570de63c8ad52ee6a91294331f4742c39972"}},{"ruleId":"D1","level":"warning","message":{"text":"Field::build (cyclomatic 25): Field::build 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":"maploc/src/field.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e44f40c43ef7654da979c668955187b84926652233a8269e97ec4f683a6a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"traits.facts (cyclomatic 25): traits.facts 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":"spaces/vetbook/traits.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84b2b19e65d7d5c71e8f5e70c6fb902378c224b4f5af606b6d2a040d69ac7f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Mapper::search_once (cyclomatic 24): Mapper::search_once 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":"maploc/src/mapper.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"3852da45eff25f2268426cee7bf158659d055d355a4f56fd09c07c3b861e2666"}},{"ruleId":"D1","level":"warning","message":{"text":"maploc::matcher::summarize (cyclomatic 24): maploc::matcher::summarize has cyclomatic complexity 24 (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":"maploc/src/matcher.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96cac5093a49a91a6688cbd6bc3527da4628f7cc5213b47e3122858f179b18c"}},{"ruleId":"D1","level":"warning","message":{"text":"Brain::enter (cyclomatic 23): Brain::enter has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/brain.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"37305ebb1195fe3668a27ee1e08f712de21aa42bd894cca90e566481c1e71768"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkManager::connect (cyclomatic 23): NetworkManager::connect 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":"configd/src/nm.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dbada4759fff2f1f65e16e838476c117e1803b0e89fdedbcfbccba72334546"}},{"ruleId":"D1","level":"warning","message":{"text":"configd::dispatch (cyclomatic 23): configd::dispatch has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f16b8f448c2ea0872068cde1016d3e0fe86053f7b04dbf4d8f3e41a4cc1f0b"}},{"ruleId":"D1","level":"warning","message":{"text":"nfc::watch (cyclomatic 23): nfc::watch 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":"nfc/src/main.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1e6e2dc58e3b8945b6226bc01a0fc782516621945280c46d0b5b8ed5dfa4c0"}},{"ruleId":"D1","level":"warning","message":{"text":"BlueZ::bond (cyclomatic 22): BlueZ::bond 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":"configd/src/bluez.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"e595694a94bff91127e56d6b35e14fe71dbf7597e929132042cd04046b4a79f6"}},{"ruleId":"D1","level":"warning","message":{"text":"OccupancyGrid::render (cyclomatic 22): OccupancyGrid::render has cyclomatic complexity 22 (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":"maploc/src/grid.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cf07465f1e6417ceac19feb8d35d731acf01a80d6f698a85f425f4f73b38b7"}},{"ruleId":"D1","level":"warning","message":{"text":"View::absorb (cyclomatic 22): View::absorb 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":"robotctl/src/monitor.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aad31cacfbdac28382f6765cdc4802b6b13593b943fd07ce7bb4eb91da08c3"}},{"ruleId":"D1","level":"warning","message":{"text":"SoccerParams::check (cyclomatic 22): SoccerParams::check 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":"robotd-params/src/lib.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe883c5bb9517f29391be9f79b4ad7082744b2c5bcb12e72f42ddc89abf5dfe"}},{"ruleId":"D1","level":"warning","message":{"text":"View::power (cyclomatic 21): View::power 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":"robotctl/src/monitor.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e82637c67f13e741b83863ce350dd0e7c435a8b2f3739a4ddbe14c862ee73f6"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::run_pad_bindings (cyclomatic 21): robotctl::run_pad_bindings 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":"robotctl/src/main.rs"},"region":{"startLine":5229}}}],"partialFingerprints":{"codehealthFindingId/v1":"741d7d6c856b8dc00f116144f6b6a1b654c2af2186f4d75f4c8a2b6c7ad0e7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"updater::install (cyclomatic 21): updater::install 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":"updater/src/main.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"1466a44571c81dd8b43fb5d5fc8d8218ad20c887e232adf65d3ef6b5f3339c29"}},{"ruleId":"D1","level":"warning","message":{"text":"hub.readHub (cyclomatic 21): hub.readHub has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 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":"spaces/policy-playground/web/src/hub.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5be327d9254b740e0c630565002e1fa31687fc4c782ca7d663febd9ff840f44"}},{"ruleId":"D1","level":"warning","message":{"text":"Mapper::on_state (cyclomatic 20): Mapper::on_state 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":"maploc/src/mapper.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af54da722c0cd7f5ecdafd6090bfe177d97fc2653ca32c04137316ed19cf9d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Mapper::track (cyclomatic 20): Mapper::track 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":"maploc/src/mapper.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedff90ef4a0c7d6064c8b98df5a847f9d3e7d6ad16096fe0981ea73f927132f"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::show::event_line (cyclomatic 20): robotctl::show::event_line 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":"robotctl/src/show.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cafbd848eb31510a00b61af411ed5f57c56377be04b1f8a17af5ba46da9edb"}},{"ruleId":"D1","level":"warning","message":{"text":"robotd::main (cyclomatic 20): robotd::main 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":"robotd/src/main.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"897821b779f5ac9ac59f705716cdee1f1c9064e804fd7def916014373e532f33"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.$(\u0022connect\u0022).onclick (cyclomatic 20): index.html.$(\u0022connect\u0022).onclick has cyclomatic complexity 20 (threshold 15). Of this number, 17 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":"mediad/webclient/index.html"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aab3a47f8799fa60154b88dfbc57bbb29f71f2f5ecf7056c3150bdc741c9884"}},{"ruleId":"D1","level":"warning","message":{"text":"DynamixelIo::check_registers_of (cyclomatic 19): DynamixelIo::check_registers_of 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":"duck-control/src/bus.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f472d862dafa6bd059948840c4491214a30076e9e88a66db0d5a1e182382a487"}},{"ruleId":"D1","level":"warning","message":{"text":"mapd::feed::stream (cyclomatic 19): mapd::feed::stream 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":"mapd/src/feed.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"21439132574ed791d7cb83e1e01a9706feb7ccdbdbc4676c0e5cc55ee871e9bd"}},{"ruleId":"D1","level":"warning","message":{"text":"mediad::ball::find (cyclomatic 19): mediad::ball::find 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":"mediad/src/ball.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2993454ae8d63ee2dc90f7391d5bae544345242a1cbac9ce4835e0bb321cae84"}},{"ruleId":"D1","level":"warning","message":{"text":"robotd::laser::subscribe (cyclomatic 19): robotd::laser::subscribe 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":"robotd/src/laser.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d4f24a72df61973723a7611149609dda9af3396b9ecd4755135ec20a192a92"}},{"ruleId":"D1","level":"warning","message":{"text":"robotd::soccer::subscribe (cyclomatic 19): robotd::soccer::subscribe 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":"robotd/src/soccer.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3129cf86b5c84a52bc937f41dd5a6f8640ff352db92a13f9804ba26d26177a"}},{"ruleId":"D1","level":"warning","message":{"text":"Relay::session (cyclomatic 18): Relay::session 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":"mediad/src/relay.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8ea77b33bae0f5a799881c430ccd4309abab711148ba0d6ac6fc9bbb32ed1a"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::edit (cyclomatic 18): Model::edit 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: Model::resolved_hint (cyclomatic 19) 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":"robotd-params/src/edit.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc635e7d1dbf2ea9d957da1d26cac6ddfe0771004ae05ef3b12377908d058f95"}},{"ruleId":"D1","level":"warning","message":{"text":"updater::source::http::attempt_download (cyclomatic 18): updater::source::http::attempt_download 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":"updater/src/source/http.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"477a8f72733064779f4b1b40fe6fed3e717b190b54a98b2d381da931dcac9720"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.resumeSignIn (cyclomatic 18): index.html.resumeSignIn 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":"mediad/webclient/index.html"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9080ceb2a31fb585a59dac15cc3570aba9287bdfcb884fc8447b0a917e819f"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::observe (cyclomatic 17): Model::observe 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":"autod/src/obstacle.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"806cf39206b929e3211a1a5d4972d786780f0f45917c3330f8741a5a3adf9804"}},{"ruleId":"D1","level":"warning","message":{"text":"Robot::run (cyclomatic 17): Robot::run has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/sim.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebed20174405c43829122211e291d202456c3c91cf29e8717bafb9f468fb741"}},{"ruleId":"D1","level":"warning","message":{"text":"Streamer::start (cyclomatic 17): Streamer::start 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":"mediad/src/stream.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"400e46c2415a7f425769d5dc331916ff2b9cf1825c71e6fe2c2f5bbac7271db6"}},{"ruleId":"D1","level":"warning","message":{"text":"View::render (cyclomatic 17): View::render 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":"robotctl/src/monitor.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc1dc8a954522334866617b37f809f1260d2f6dfc7932a324bf2eade9dc85c9"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::run_system (cyclomatic 17): robotctl::run_system has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: robotctl::run_robot (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":3853}}}],"partialFingerprints":{"codehealthFindingId/v1":"3273bfc261945d58477e63a23ea2777dc928e1b725e785137f8fe1d05670d9a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Soccer::plan (cyclomatic 17): Soccer::plan 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":"robotd/src/soccer.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"284c953221a134bd74a066ed174f4f968a9e21f804cb40126d6ca36c735d22ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Sound::sing_start (cyclomatic 17): Sound::sing_start 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":"robotd/src/sound.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2cbf8aa15168c5b98b9273019fccea88bb2bc19ba527f2048855687733a967"}},{"ruleId":"D1","level":"warning","message":{"text":"robotd::load_policy_request (cyclomatic 17): robotd::load_policy_request 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":"robotd/src/main.rs"},"region":{"startLine":5672}}}],"partialFingerprints":{"codehealthFindingId/v1":"883787c3d72edc7bf0fa82cb04894cba7caea1c5240ab2f48fe93052cc58717b"}},{"ruleId":"D1","level":"warning","message":{"text":"sounds::main (cyclomatic 17): sounds::main 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":"sounds/src/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac035b00dc83b874ac8f984656aa0c30bd59d543383b4de66668b538438e06d"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::apply_inner (cyclomatic 17): Engine::apply_inner 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":"updater/src/engine.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab20937b81f2369c4d9ce161cf74ec91dc50968014b5d8efad20004f3330faa2"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::stage_and_swap (cyclomatic 17): Engine::stage_and_swap 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":"updater/src/engine.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e869676eac9909d0845d2d1b73fc35e9fd0af285491a585de97399bc0ddd3b6"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::package (cyclomatic 17): xtask::package 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":"xtask/src/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a6e1aa70d581c45d86ae16f493fe9794fc16c681e1dc65f97c77c8d10368fe"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.onState (cyclomatic 17): index.html.onState has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: 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":"mediad/webclient/index.html"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fe82ded151c1a6188dd49adc386a19783134fb29ef54ff5dfa4206fd4eb43c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.card (cyclomatic 17): main.card 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":"spaces/policy-playground/web/src/main.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e15c25d75d8c0c2d3246a961e581f2419f469b2ea4fa7c40e80afd40757c906"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.html.draw (cyclomatic 17): gallery.html.draw has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/vetbook/gallery.html"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5382cbd84a6911ccf84f3b8b006375744f74f0b1273d9d51ab69af98c8367ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"BlueZ::pair (cyclomatic 16): BlueZ::pair 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":"configd/src/bluez.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6084843a6aabad75f9d71913896be61dcc023f3bfb9c8db1aa96a3508965ca2f"}},{"ruleId":"D1","level":"warning","message":{"text":"duck_detect::bin::duck-bench::main (cyclomatic 16): duck_detect::bin::duck-bench::main 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":"duck-detect/src/bin/duck-bench.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b5ef7bac041d39b9954e2248ddc582b073bcda952c87360938652782a8bc38"}},{"ruleId":"D1","level":"warning","message":{"text":"duckctl::udp_pad::panel::alarms (cyclomatic 16): duckctl::udp_pad::panel::alarms 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":"duckctl/src/udp_pad/panel.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"728b923d51a5ee8b37e38eac836c9bb3e0e5070dda474dd5d77fdf0a4bef4c24"}},{"ruleId":"D1","level":"warning","message":{"text":"Sampler::sample (cyclomatic 16): Sampler::sample 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":"robotctl/src/endurance.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47d435c150f1b5956457b054ba153fbf9f94d5de04d63679b9ef2adaf6f828e"}},{"ruleId":"D1","level":"warning","message":{"text":"robotctl::print_result (cyclomatic 16): robotctl::print_result has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: robotctl::run_robot (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":6079}}}],"partialFingerprints":{"codehealthFindingId/v1":"439fa99afa11d695b7aa753aa2928efdbe0d3e0ae574a530184cdb0f3df2b3bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::validate (cyclomatic 16): Config::validate 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":"updater/src/config.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e43317bb59254dff23066cea45550923a7b282dc1267bd9e054986106eeb23f"}},{"ruleId":"D1","level":"warning","message":{"text":"updater::policy::fetch (cyclomatic 16): updater::policy::fetch 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":"updater/src/policy.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4a0b27fb65ebfb378a3ec2e0002ac271b2010cf66ef397a31384fba4031f80"}},{"ruleId":"D1","level":"warning","message":{"text":"traits.status (cyclomatic 16): traits.status 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":"spaces/vetbook/traits.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62ec0254b1094d72a25e897c481dba732c1101e1eeaa7f817d34d54e092643f"}},{"ruleId":"D2","level":"warning","message":{"text":"robotd::control_loop (cognitive 676): robotd::control_loop has cognitive complexity 676 (threshold 15). Drivers by points: if/else 166 (423 pts), match/switch 40 (133 pts), boolean chains 78, loops 13 (42 pts) (nesting depth added 379). 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":"robotd/src/main.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb2f8ae7b92554cf209e94e5db66e4d74b266f4b2e09923f136fe8dfd7dca8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Brain::step (cognitive 249): Brain::step has cognitive complexity 249 (threshold 15). Drivers by points: if/else 121 (216 pts), boolean chains 23, match/switch 6 (10 pts) (nesting depth added 99). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/brain.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"a948d9d1da4fed082bc0b1745b5fc06382e3f5ab98f2931577e11c009a2e46d4"}},{"ruleId":"D2","level":"warning","message":{"text":"duckctl::run (cognitive 158): duckctl::run has cognitive complexity 158 (threshold 15). Drivers by points: if/else 57 (116 pts), boolean chains 18, match/switch 9 (18 pts), loops 4 (6 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/main.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c23f897e05a02472c6ec5fd907115a6e538990ee5b8b1821c5a731747501a4"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::configure::run (cognitive 125): robotctl::configure::run has cognitive complexity 125 (threshold 15). Drivers by points: if/else 32 (80 pts), match/switch 13 (42 pts), loops 2, boolean chains 1 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/configure.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d731b9c7b68372b86e99d6ee7af0fbaa77a9c8bbbfd37d2d0105bad11cffa3"}},{"ruleId":"D2","level":"warning","message":{"text":"autod::drive (cognitive 122): autod::drive has cognitive complexity 122 (threshold 15). Drivers by points: if/else 41 (91 pts), boolean chains 14, match/switch 5 (12 pts), loops 2 (5 pts) (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":"autod/src/main.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e55671473c98233b137b1b3815b36f2e51ff77d29d7bdc969a1e1aa407b7731"}},{"ruleId":"D2","level":"warning","message":{"text":"netpadd::serve (cognitive 109): netpadd::serve has cognitive complexity 109 (threshold 15). Drivers by points: if/else 21 (68 pts), match/switch 11 (27 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netpadd/src/main.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c24bfe489a95c696f55bddf67230eab8aa274aafd9dec43de9198b153c0a93"}},{"ruleId":"D2","level":"warning","message":{"text":"padd::main (cognitive 107): padd::main has cognitive complexity 107 (threshold 15). Drivers by points: if/else 28 (72 pts), match/switch 11 (25 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"padd/src/main.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"550bb91d9296075672daa03f888a05de4bc82db7dce8f8e5a3bb9044a2d5db11"}},{"ruleId":"D2","level":"warning","message":{"text":"duckctl::udp_pad::run (cognitive 99): duckctl::udp_pad::run has cognitive complexity 99 (threshold 15). Drivers by points: if/else 28 (61 pts), match/switch 11 (22 pts), loops 4 (9 pts), boolean chains 7 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/udp_pad.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b20336c5e3ef6c28accf839a8da67ec26d4da4065cb9b8df1c5e9595df0daa"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::solve (cognitive 99): Graph::solve has cognitive complexity 99 (threshold 15). Drivers by points: loops 15 (47 pts), if/else 15 (45 pts), boolean chains 7 (nesting depth added 62). 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":"maploc/src/graph.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ce8ed706dec699e4a416428b3948e86b963cc6f9b02dd3412e6036fa69a6be"}},{"ruleId":"D2","level":"warning","message":{"text":"btd::secure::run (cognitive 94): btd::secure::run has cognitive complexity 94 (threshold 15). Drivers by points: if/else 19 (84 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"btd/src/secure.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2f8c2abc5317bd5e0471970d36bc4591c0b8548c86b586bc755b25739c974b"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::main (cognitive 82): mediad::main has cognitive complexity 82 (threshold 15). Drivers by points: if/else 29 (46 pts), match/switch 15 (26 pts), loops 5 (10 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/main.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9db611618b1de29cc442cad9959c87ecbbd95988ef53ab9cb7b26c6cdc45b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::configure::draw (cognitive 65): robotctl::configure::draw has cognitive complexity 65 (threshold 15). Drivers by points: if/else 33 (56 pts), match/switch 5 (7 pts), boolean chains 1, 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":"robotctl/src/configure.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f98f241376fb1869f1bf6b8043a97023323f2592475ef1b9dcb1d919695f5bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Controller::step (cognitive 63): Controller::step has cognitive complexity 63 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 9, match/switch 5 (8 pts), loops 3 (7 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":"robotd/src/control.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"648f928ffd387d389f14d8cd19a48c876ea0a720c54d3a02f3da11fcf65ec55a"}},{"ruleId":"D2","level":"warning","message":{"text":"sounds::chorale::midi::parse (cognitive 62): sounds::chorale::midi::parse has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 3 (12 pts), loops 3 (5 pts), boolean chains 4 (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":"sounds/src/chorale/midi.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e72e4a9c5544eecc1080609967c43f5e622450d3275f1a703b77d38201c784"}},{"ruleId":"D2","level":"warning","message":{"text":"robotd::dispatch (cognitive 57): robotd::dispatch has cognitive complexity 57 (threshold 15). Drivers by points: if/else 30 (47 pts), match/switch 4 (7 pts), boolean chains 3 (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":"robotd/src/main.rs"},"region":{"startLine":5853}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ea69a14e88f1e57966fe5faccabb09149eba59c00e076e086646a8e4f88ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"robotd::handle (cognitive 54): robotd::handle has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 9 (24 pts), loops 1 (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":"robotd/src/main.rs"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67ce7d7a6162a9c9f9d78f50063e75e4b0177d5a0fd81a3e3c8769945618f10"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker::tick (cognitive 53): Tracker::tick has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 11, loops 4 (9 pts), match/switch 3 (4 pts) (nesting depth added 12). 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":"robotd/src/vetbook.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db84bf5baacf972f2ba966b36dcd605ea5053d84794d842623d2a3193b2821b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.onSignalling (cognitive 52): index.html.onSignalling has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 12, ternaries 4 (9 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ed48468dce6b7d38d5adeaa31f1e76a36dd00fab969576378021bf0efbd464"}},{"ruleId":"D2","level":"warning","message":{"text":"Brain::pick_next_state (cognitive 49): Brain::pick_next_state has cognitive complexity 49 (threshold 15). Drivers by points: if/else 30 (43 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/brain.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"908f97395ba019330e9f6c2e5458bfbf0a5818f771937baa65b56e5bc5bf2d9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::dispatch (cognitive 48): Server::dispatch has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 22 (42 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"updater/src/ipc.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad0ce0037e27f735e338673e2b346d8ac4ffe475020512a6f1e2affc10456d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::tick (cognitive 46): Mapper::tick has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (25 pts), loops 5 (9 pts), boolean chains 7, match/switch 4 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pad-map/src/mapper.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d7321d6072917fcf74b69362073080d68217e1ec8f900dd59e0c243b0dc449"}},{"ruleId":"D2","level":"warning","message":{"text":"Params::validate (cognitive 45): Params::validate has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 12, loops 5 (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":"robotd-params/src/lib.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"836e67f39c5b694b25db0a76a77bb0f8af7675277af2fab04f677b8676df3316"}},{"ruleId":"D2","level":"warning","message":{"text":"maploc::matcher::summarize (cognitive 43): maploc::matcher::summarize has cognitive complexity 43 (threshold 15). Drivers by points: loops 14 (23 pts), if/else 8 (18 pts), boolean chains 2 (nesting depth added 19). 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":"maploc/src/matcher.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaed762efba6a7b9ad28da9d535a643170b7352d6c3183ab001f44d7546b55e"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::render_health (cognitive 43): robotctl::render_health has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 7 (15 pts), loops 3 (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":"robotctl/src/main.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03f032e5a0c70904a505a851c769dbe200b7462a5e1e8015f9050aafd5e636c"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::vetbook::live (cognitive 43): robotctl::vetbook::live has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 6 (19 pts), boolean chains 1, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/vetbook.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c5e68a7a0512858260a4f7a9931510c111669585cbe402c175c1956e307abb"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::run_policy (cognitive 42): robotctl::run_policy has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 5 (9 pts), loops 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":4353}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a34cf2d9f04dd53757ba3d2dec71cba36252c1ac419697eb6a13fb33fd42fd"}},{"ruleId":"D2","level":"warning","message":{"text":"cards.card_for (cognitive 41): cards.card_for has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 26, ternaries 10, if/else 5. 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":"spaces/vetbook/cards.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e28d8851d4c37302b92379d56c7924f6e2ae19f830fb2b074d8ba417a336f47"}},{"ruleId":"D2","level":"warning","message":{"text":"duck_ether::serve (cognitive 39): duck_ether::serve has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 2 (4 pts), boolean chains 2, match/switch 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":"duck-ether/src/main.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb99eb905678edb7d69cdea2f29c2621768d2bdb9f88fa08671d0ce85f88ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"Field::build (cognitive 39): Field::build has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 10 (15 pts), boolean chains 5 (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":"maploc/src/field.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04455733698056595b0af103c622d9ace1251915f226f28873c58e6551ca870"}},{"ruleId":"D2","level":"warning","message":{"text":"OccupancyGrid::render (cognitive 39): OccupancyGrid::render has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 8 (16 pts), boolean chains 5 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/grid.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8e387aaf9bca63c1a50762f1020bfb0f1ab10bfe8ca4a55c8cd085025ab545"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkManager::connect (cognitive 37): NetworkManager::connect has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 5 (8 pts), boolean chains 5, 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":"configd/src/nm.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c06ba174e00ef03abfaf1e807e39cec44afb91d5bac267843a75c59ad0c215"}},{"ruleId":"D2","level":"warning","message":{"text":"nfc::watch (cognitive 36): nfc::watch has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (16 pts), boolean chains 3, 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":"nfc/src/main.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3924658456fe64209cb9a3a6fc8b688eec80025d2a27dcfb2ed5a5efad2664"}},{"ruleId":"D2","level":"warning","message":{"text":"robotd::head_imu::reader::run (cognitive 36): robotd::head_imu::reader::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/head_imu.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d4c2db8be358e62482ca9196fcd31f0cd08401ace68404a293242bc32977c9"}},{"ruleId":"D2","level":"warning","message":{"text":"duckctl::udp_pad::panel::render_robot (cognitive 35): duckctl::udp_pad::panel::render_robot has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 9 (13 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/udp_pad/panel.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ffd06675c2993111dc6c97216571ff0d69ddeef2bc6b2d312a91fbbef1bc4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Robot::run (cognitive 35): Robot::run has cognitive complexity 35 (threshold 15). Drivers by points: loops 9 (25 pts), if/else 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 22). 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":"maploc/src/sim.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9a24e9028108223ed100ea073d1bf99493f978f4764dfe17dd6dd33935ee4e"}},{"ruleId":"D2","level":"warning","message":{"text":"mapd::feed::stream (cognitive 34): mapd::feed::stream has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 6 (11 pts), boolean chains 1, 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":"mapd/src/feed.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d46061e8d3b1d16013d5f8eed992467efadd74c32b0fd51774113e8d315aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Score::from_gestures (cognitive 34): Score::from_gestures has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 5 (13 pts), match/switch 1 (2 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":"sounds/src/chorale/mod.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba81728e15bf5b02d90635a91dd2958c1356626a7097e45024b1233ae55b9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"btd::chorale::radio::run (cognitive 33): btd::chorale::radio::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (20 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":"btd/src/chorale.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d47add521e8e0055e9ce8b892fef77e8d9463f46cb9b676c75f8f3890e2583"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::run_pad_bindings (cognitive 33): robotctl::run_pad_bindings has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 3 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":5229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6199386278cfbed5f3aaeb4144c4e5bc96dd9813806babd8ecf81ae91451c9"}},{"ruleId":"D2","level":"warning","message":{"text":"BlueZ::bond (cognitive 32): BlueZ::bond has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 6 (15 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":"configd/src/bluez.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56e72718da816db59845013fac8d2356a610a5ae7befec5ff33866bf8bd9b69"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::ball::find (cognitive 32): mediad::ball::find has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 5 (7 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":"mediad/src/ball.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e106edf786e6ac5363a3a834c14cc2e17b7eb4837c80c7742e55ccde6dee1bba"}},{"ruleId":"D2","level":"warning","message":{"text":"mapd::run (cognitive 31): mapd::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (9 pts), loops 2 (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":"mapd/src/main.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dceda874c61651f61ee24701f17b692edcf434944e6f73e69dbbb44bd6330b2"}},{"ruleId":"D2","level":"warning","message":{"text":"hub.readHub (cognitive 31): hub.readHub has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 5 (9 pts), loops 4 (6 pts), boolean chains 2, error handling 1 (nesting depth added 13). Of this number, 30 points are the body\u0027s own statements and 1 belongs 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":"spaces/policy-playground/web/src/hub.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e1941db2bd8a4ca055ced66eaccff98961ed2d6bfab44000c8f8614ae21d62"}},{"ruleId":"D2","level":"warning","message":{"text":"duck_detect::bin::duck-bench::main (cognitive 30): duck_detect::bin::duck-bench::main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (5 pts), boolean chains 1, match/switch 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":"duck-detect/src/bin/duck-bench.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d2b19e0a0e4b536e7fddadc32d524e2db204c72a38fad2ca74cfdc0f8b67a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::search_once (cognitive 30): Mapper::search_once has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 3 (5 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":"maploc/src/mapper.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87f9deafd885d65de5117636ee36b838e1de8a328658a800fdf45c6a83033c0"}},{"ruleId":"D2","level":"warning","message":{"text":"duckctl::udp_pad::panel::alarms (cognitive 29): duckctl::udp_pad::panel::alarms has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (29 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/udp_pad/panel.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe6c5758abb011b6a8ec4bcc5cdb650becdfe51bb9fac5c7478bf6e2f311567"}},{"ruleId":"D2","level":"warning","message":{"text":"robotd::laser::subscribe (cognitive 29): robotd::laser::subscribe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/laser.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b4a9a1086fbbef6fcf238553af83c65568d5de9f11e71a2f142251cab0f42e"}},{"ruleId":"D2","level":"warning","message":{"text":"robotd::soccer::subscribe (cognitive 29): robotd::soccer::subscribe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/soccer.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc376ad009a0781c5c21b55ca060a99fe45ac9c52296c87466ad79695e34a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"btd::session::run (cognitive 28): btd::session::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"btd/src/session.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e4180db367e28d5c456203516acae441bbf800dad1d4b2fa4d822eef25a37c"}},{"ruleId":"D2","level":"warning","message":{"text":"Relay::session (cognitive 28): Relay::session has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 6 (12 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":"mediad/src/relay.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d01a7ec2f7ece411c69172a209230aea1c3aea18e5645cfbd0dda9834b64392"}},{"ruleId":"D2","level":"warning","message":{"text":"View::power (cognitive 27): View::power has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 3 (5 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/monitor.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"da187ccae03b4e2db8447a139d6fb6f8c9f9816f2fa3071207104bdedaaec18b"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::recover_on_start (cognitive 27): Engine::recover_on_start has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/engine.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06763b6a31ed0f7a19ade4861523058d148defea38e03792830c46231fb3750"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.$(\u0022connect\u0022).onclick (cognitive 27): index.html.$(\u0022connect\u0022).onclick has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 11). Of this number, 24 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"52345518405b471df2a9f623fd56d124690c26af90ff62538659a64d5d89c7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"configd::wifi_ssh::watch_button (cognitive 26): configd::wifi_ssh::watch_button has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/wifi_ssh.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"215d9df8e60dd3a3f7d417dcd3db2a2f08150626a9f7415746adc7d259bed069"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::track (cognitive 26): Mapper::track has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6, match/switch 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":"maploc/src/mapper.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b87d42987e918d7bbf570f4536f106038c2912ef2054baae32459c1c71cb2dc"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::laser::serve_looks (cognitive 26): mediad::laser::serve_looks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/laser.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c8cb058a8d7f61a606c5339491366db7cd3a48f167a56f67989f796988cc49"}},{"ruleId":"D2","level":"warning","message":{"text":"padd::tap::stream_imu (cognitive 26): padd::tap::stream_imu has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"padd/src/tap.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"658ac3a8a7f772d52828422f3b4296de242440d297e7bad8acf8390bdc2d8dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Streamer::start (cognitive 25): Streamer::start has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (6 pts), boolean chains 3, 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":"mediad/src/stream.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"235366a5db6cac5b57795e0d23aca782cca34ffab3a0dcf1056d52d8053921de"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundSentry::frame (cognitive 25): SoundSentry::frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (24 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":"pet-detect/src/worker.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"020f745d6e890ada9f1d9e7527eaf53e193df6cb029ce599aaa6b453a07587f8"}},{"ruleId":"D2","level":"warning","message":{"text":"View::render (cognitive 25): View::render has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (22 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/monitor.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab18b31b02c68f6c7683ca5cb0b259bfcb92b299ea023baf6e6b07988cc8af3"}},{"ruleId":"D2","level":"warning","message":{"text":"Soccer::plan (cognitive 25): Soccer::plan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4 (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":"robotd/src/soccer.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"62601c5c15bb9120f8cbcc6f5dcda44556911af762b16a7b0521ae98f47a0435"}},{"ruleId":"D2","level":"warning","message":{"text":"Sound::sing_start (cognitive 25): Sound::sing_start has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/sound.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01bc7bdd0f2f69c6d7d8b1418686d3d332a40400dbd4bef1de98e49f3a4902d"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::check_all (cognitive 25): Server::check_all has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (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":"updater/src/ipc.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"341f031996482a40fc3e5f69b2808bd42b297dab54f65be3131d173b34c801e6"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::exposure::spawn (cognitive 24): mediad::exposure::spawn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/exposure.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fce8462c4110a3b865cadef28eff240244488fe7bc79af36fa352516e7ec38"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::print_result (cognitive 24): robotctl::print_result has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (7 pts), loops 2 (6 pts) (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":"robotctl/src/main.rs"},"region":{"startLine":6079}}}],"partialFingerprints":{"codehealthFindingId/v1":"7611ce1af361e6747dac7923aa706759f6f60e41e945401b378d811ad03903de"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::package (cognitive 24): xtask::package has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3 (5 pts), boolean chains 3, 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":"xtask/src/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2abde29136581cc751c4349908768d71d58e3b5306a328834eab1c5d7c7e43"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::on_state (cognitive 23): Mapper::on_state has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 9 (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":"maploc/src/mapper.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca89fcf284eb377a45894dd9b2cd32483011f28de5ea215341b0c5add4d5768"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::relay::carry (cognitive 23): mediad::relay::carry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (7 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":"mediad/src/relay.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a20aa0ff30b7526cde4935e38956511d2ef5033692f41b88bea69f30403369f"}},{"ruleId":"D2","level":"warning","message":{"text":"Sampler::sample (cognitive 23): Sampler::sample has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/endurance.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"154cabf3f97be419d1f5cc5d245c38541ab31ba86f380fa44f7df3d8861cd4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::validate (cognitive 23): Config::validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (5 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":"updater/src/config.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"485a96efc991d9a9bb9a1c5ce291b485f51de313e0c8adab23a2eabac42cde28"}},{"ruleId":"D2","level":"warning","message":{"text":"traits.facts (cognitive 23): traits.facts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, boolean chains 4, ternaries 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":"spaces/vetbook/traits.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0dd98216bff1e1bd6bbc8d149bbb3937e71b4c840d230c97c7e763bc96ff6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Field::pooled (cognitive 22): Field::pooled has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (10 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/field.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c0c4e24cf676f06229ebf35beb3eb3d3365caa3ca418f59e034a9d539a4489"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::laser::find (cognitive 22): mediad::laser::find has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 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":"mediad/src/laser.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9775603b0b8166bec887dfa5c89ae905abe804d207b426f27e5cf6b72f569c"}},{"ruleId":"D2","level":"warning","message":{"text":"Chorale::heard (cognitive 22): Chorale::heard has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/chorale.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12c8f89414aa06f500ee31207df491236c54b65f1e49197453fafc1dc09d7de"}},{"ruleId":"D2","level":"warning","message":{"text":"SoccerParams::check (cognitive 22): SoccerParams::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 10, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd-params/src/lib.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebce8e624498424b04b9261be83bfc13158d24fa8c020b50e8da5e966fe411fe"}},{"ruleId":"D2","level":"warning","message":{"text":"tof::sensor_loop (cognitive 22): tof::sensor_loop has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 2 (7 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tof/src/main.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2731f891c78ffe79b3ffae4ea43454010bc01ea0ae50be7ecade6cfe85ca49"}},{"ruleId":"D2","level":"warning","message":{"text":"DynamixelIo::check_registers_of (cognitive 21): DynamixelIo::check_registers_of has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), 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":"duck-control/src/bus.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"066b257087379a7d50046c5f4a75329fc44b2353b8578999b006df38b2895f91"}},{"ruleId":"D2","level":"warning","message":{"text":"Skyline::solve (cognitive 21): Skyline::solve has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/graph.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"419e939d7fe67add8503f7fad7f13615ba807151060cb9fc750a13bb0e52b2c9"}},{"ruleId":"D2","level":"warning","message":{"text":"maploc::matcher::eigen_sym3 (cognitive 21): maploc::matcher::eigen_sym3 has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/matcher.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb77223aaf0370d56924d2ef0fbdd56c921f4fc71f212d00b502e5a89862335a"}},{"ruleId":"D2","level":"warning","message":{"text":"netpadd::health::poll_health (cognitive 21): netpadd::health::poll_health has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (11 pts), if/else 2 (6 pts), loops 2 (4 pts) (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":"netpadd/src/health.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab9bceae87d40d34f6480d4bdc64a230eaa907e3272c5707e06a9490298df07"}},{"ruleId":"D2","level":"warning","message":{"text":"Soccer::tick (cognitive 21): Soccer::tick has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/soccer.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c54ace2a45f1f14df31e90d7b67391de68a707b3cce1f22e2aacc7a05027825"}},{"ruleId":"D2","level":"warning","message":{"text":"Sound::theremin_start (cognitive 21): Sound::theremin_start has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/sound.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6a533f7dcd8117d4932c6420acdbdd763d8244cb215208d253b93ef50386a1"}},{"ruleId":"D2","level":"warning","message":{"text":"robotd::main (cognitive 21): robotd::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 6 (8 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93dec19a336cad55d29ee60d4f7fc7919c2916e456358d48b84f0d8056d3e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::observe (cognitive 20): Model::observe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/obstacle.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ed1df7373f9221ebffc9b97c1f3d3da7f6d8178a4d5d92477aa2c6829c3123"}},{"ruleId":"D2","level":"warning","message":{"text":"Projector::project (cognitive 20): Projector::project has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 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":"maploc/src/project.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"64894d1634e5b9ad97bb2a9cfca74fd5c760df0b6bd5ace1c7722d6ed8ad5313"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::detect::spawn (cognitive 20): mediad::detect::spawn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 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":"mediad/src/detect.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0bd32af562cb1308ced8413682ecdf77dc2a2e8d5d085a494e16914450c61e"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::monitor::live (cognitive 20): robotctl::monitor::live has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (12 pts), loops 3 (5 pts), if/else 1 (2 pts), boolean chains 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":"robotctl/src/monitor.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1710cbd840c94bbc3fdcbb071c6aee8b806fb3601bcf24799fe130635e049e"}},{"ruleId":"D2","level":"warning","message":{"text":"BlueZ::pair (cognitive 19): BlueZ::pair has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (3 pts), boolean chains 2 (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":"configd/src/bluez.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7336b35b0e419ac446f9d099d7131b2629650fccbd04e0d97446db0f00c3009a"}},{"ruleId":"D2","level":"warning","message":{"text":"duck_ether::nearby (cognitive 19): duck_ether::nearby has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-ether/src/main.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab89d0ee0df476f9815e97399139c74dc15b56f332f4b7ea462cc0a1ae0d26f"}},{"ruleId":"D2","level":"warning","message":{"text":"maploc::matcher::score_grid (cognitive 19): maploc::matcher::score_grid has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 1 (5 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/matcher.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b913dcb50cb5a07ef64b9bd568cc5fa7717179955007c4922f29347b7c9e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::frame::handle (cognitive 19): mediad::frame::handle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (4 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":"mediad/src/frame.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6f0af33d96a5bd16350ef675f0a06f0a8c6d1927912a7820c5be92eccaf0b1"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::run_chorale (cognitive 19): robotctl::run_chorale has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (7 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":"robotctl/src/main.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7045ddf693d0e19cdc7f9c77ad26e0e1cd8be47496d32aa3cca13b3ebb89460b"}},{"ruleId":"D2","level":"warning","message":{"text":"robotd::load_policy_request (cognitive 19): robotd::load_policy_request has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":5672}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9fd6fd23cd4fcf6827f8420f80eb86fc88829ea264071ba447ce3347bb6ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"Personality::harmonics (cognitive 19): Personality::harmonics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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":"sounds/src/personality.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7e4a82548f03303a2ca96d31b62525763c466165e44b322989888f327c2c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream::block (cognitive 19): Stream::block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sounds/src/stream.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1354ab380ef016f28672a3cb5dc66af79441f9fda27eb9c94fb4d01d548664"}},{"ruleId":"D2","level":"warning","message":{"text":"sounds::chorale::text::parse (cognitive 19): sounds::chorale::text::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sounds/src/chorale/text.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2ddf0215e361ac845053aeef60a7d4ac4283fb9af9ff847ef59a9d0661abec"}},{"ruleId":"D2","level":"warning","message":{"text":"sounds::main (cognitive 19): sounds::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 5 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sounds/src/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9332a48853979026de86d6cf68f99be32de3b8765540f02bb1bbe190edd45dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.resumeSignIn (cognitive 19): index.html.resumeSignIn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f57a19f646249360f5d67eba466832019015f738e61cf6a1c7f00b3b8ca7fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.onControl (cognitive 19): index.html.onControl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6831988a4db5daa9eadfe5b6de210e8d469989d64b7e31524923e5ec7788a3"}},{"ruleId":"D2","level":"warning","message":{"text":"BlueZ::find (cognitive 18): BlueZ::find has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/bluez.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"813dafa96ebb69fe65fe04fa1ebe02b30de88a499952547fee8039391f6e8c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::repair_components (cognitive 18): Mapper::repair_components has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/mapper.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d1883dd691f86cc233d8e605c494d8ddf9a468997032d6edccdb607c84b915"}},{"ruleId":"D2","level":"warning","message":{"text":"Relay::handle (cognitive 18): Relay::handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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":"mediad/src/relay.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf3d506560e22fe4aecce7ec89d59d76045e980de859f9621de1ed91aa23d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::pipeline::meter_capture_rate (cognitive 18): mediad::pipeline::meter_capture_rate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, match/switch 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":"mediad/src/pipeline.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be0558182fa4d8e14a157630572799cb9840b50b6698df1cb6000d30d82fc73"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::stream::carry (cognitive 18): mediad::stream::carry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/stream.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15ff48701c654e389d60519d8b3143c7b348b0763cb8d198e4e90f560f9a7fc"}},{"ruleId":"D2","level":"warning","message":{"text":"DuckView::draw (cognitive 18): DuckView::draw has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 4 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/duck.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ba4a4aea095000b02be0d765f6eb208239d01d342921a02228e9bd559630f1"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::monitor::subscribe_to_tof (cognitive 18): robotctl::monitor::subscribe_to_tof has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/monitor.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca84e0b56eae06872dbf8b19fd25b4a208bfdc48dc12e3ab442db98b30a2dba"}},{"ruleId":"D2","level":"warning","message":{"text":"updater::policy::fetch (cognitive 18): updater::policy::fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/policy.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9b3c6effae9911d076ed098c935edf4f2f967b79b9a911424657ed69b312fd"}},{"ruleId":"D2","level":"warning","message":{"text":"updater::source::http::attempt_download (cognitive 18): updater::source::http::attempt_download has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, 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":"updater/src/source/http.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dee32cd12445d29a711b22b30baf149a3d2b618380ed677ff1d81a97011962"}},{"ruleId":"D2","level":"warning","message":{"text":"Brain::take_fix (cognitive 17): Brain::take_fix has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (6 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":"autod/src/brain.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b692dfe8962e258a6f0a71404d4b635ac1d3d9387036164d54baf7830dc8f92d"}},{"ruleId":"D2","level":"warning","message":{"text":"btd::bluez::reconcile_advertisement (cognitive 17): btd::bluez::reconcile_advertisement 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":"btd/src/bluez.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88d336f04c3d133e4f98a7263a45331e99a98460e76a1f16088506354297aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"duckctl::request_line (cognitive 17): duckctl::request_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 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":"duckctl/src/main.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0ea3ce4d0183ef52774b84291078ac53810f991974ab146e17f7bfe105fe6b"}},{"ruleId":"D2","level":"warning","message":{"text":"padd::tap::stream (cognitive 17): padd::tap::stream has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 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":"padd/src/tap.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"5334c73df807ae196259a976c67b201b13ee13ecb11c5d9cc80551328e5de31e"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::run_soccer (cognitive 17): robotctl::run_soccer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (8 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":"robotctl/src/main.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"48124564d6eecd78e5ba37bda5b17a26f4c0850807a1d1c28f9ce0ba252fa312"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::run_policy_skill (cognitive 17): robotctl::run_policy_skill has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":4628}}}],"partialFingerprints":{"codehealthFindingId/v1":"4280410842801d6ee3012e1adcd6b81176f8346c2f89bdc2b3fdd77980fa8497"}},{"ruleId":"D2","level":"warning","message":{"text":"Sound::start_wheee (cognitive 17): Sound::start_wheee has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/sound.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a731c704ab57272844e5b40d2f1553a80a78f6d68d68a5552710473b5ec38d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::rendered (cognitive 17): Model::rendered has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd-params/src/edit.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"81128e01b92eaceb23f91d0dd7956a32611ce0158e414293397cd817a2b1abb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::stage_and_swap (cognitive 17): Engine::stage_and_swap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 3 (5 pts), loops 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":"updater/src/engine.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bb8c792240399b30a11a1ca30522f21c85d4a00ce1c21b3877a1831fae8b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"updater::install (cognitive 17): updater::install has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (9 pts), if/else 4 (7 pts), loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/main.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7699f7a024d18cd3e83129ab6b002b781f4b0e6f6448212e78c83214436d23"}},{"ruleId":"D2","level":"warning","message":{"text":"updater::os::start_with (cognitive 17): updater::os::start_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"updater/src/os.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cab4a959a4e67d4de2a9d1c3e45ca9406881ac5ed4c3b0a45069e623d04c763"}},{"ruleId":"D2","level":"warning","message":{"text":"WsConsumer._pump (cognitive 17): WsConsumer._pump has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1, error handling 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":"spaces/shared/wire.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e0836f034543a61ff05306d35bb354f2d92f081106ce5dea83997b18d6de59"}},{"ruleId":"D2","level":"warning","message":{"text":"main.header (cognitive 17): main.header has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 1 belongs 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":"spaces/policy-playground/web/src/main.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c631bd0821390f30daaefa3674e8c1d175cff99c8d826dee6a834163f12c0f38"}},{"ruleId":"D2","level":"warning","message":{"text":"Brain::enter (cognitive 16): Brain::enter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"autod/src/brain.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8357288d8527140ab3943055d16332a254cb511eb64aed36d3e7b1dddd8be8c"}},{"ruleId":"D2","level":"warning","message":{"text":"autod::subscribe (cognitive 16): autod::subscribe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/main.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5861dcf32f28d13921677104f82feb39fcf85daf355aae584276b1e70a04d9e1"}},{"ruleId":"D2","level":"warning","message":{"text":"btd::session::dispatch (cognitive 16): btd::session::dispatch has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 3 (4 pts), boolean chains 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":"btd/src/session.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03b9c1f50737c68c1ef40469752811f49cadd5221e741b2fcfe307eb849bb08"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkManager::scan (cognitive 16): NetworkManager::scan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/nm.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b740683703e67231ac5f1b2b0de90282a728d38042555255de101c4e2ca99d1"}},{"ruleId":"D2","level":"warning","message":{"text":"mapd::server::connection (cognitive 16): mapd::server::connection has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mapd/src/server.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1127ce514eec6332d943cb32ab830ea97e745ad1548a21f8f50f65e138bf93b4"}},{"ruleId":"D2","level":"warning","message":{"text":"maploc::matcher::match_wide (cognitive 16): maploc::matcher::match_wide has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 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":"maploc/src/matcher.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7674440971cea0fa7611f2255437b41fc044e8b9f81917bf2c1d6fcb82168400"}},{"ruleId":"D2","level":"warning","message":{"text":"mediad::session::handle (cognitive 16): mediad::session::handle has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 3 (4 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":"mediad/src/session.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c183664dc897aa2a163a68abcf66df7c9d213cee6f5daf7d2a0f9bb8268dbdf"}},{"ruleId":"D2","level":"warning","message":{"text":"PadView::frame (cognitive 16): PadView::frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), 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":"robotctl/src/monitor.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd92245814cd9144e41c6069a00164ccd70e4e9242faeae383da64daf9bb454"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::render_policies (cognitive 16): robotctl::render_policies has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":5052}}}],"partialFingerprints":{"codehealthFindingId/v1":"4298f51fec64b168b4207856b50dfdb6e474a6e99027fec3f74abe3623756e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::show::render (cognitive 16): robotctl::show::render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 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":"robotctl/src/show.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4638cc2a8fc5b8630d20e1c0ab19dce174a6b4a745fe3774b6d1352527f0b63"}},{"ruleId":"D2","level":"warning","message":{"text":"robotctl::show::event_line (cognitive 16): robotctl::show::event_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (6 pts), loops 1 (2 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":"robotctl/src/show.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"307ee83f8e5be955e2684371664eb5f8924315c685fbc9dc6697917ccd619275"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::edit (cognitive 16): Model::edit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd-params/src/edit.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"98464e6e906fbef76bd009291ec85de4c16acff20d73221fa5f9f2da2c5507a4"}},{"ruleId":"D2","level":"warning","message":{"text":"tof::imu::imu_loop (cognitive 16): tof::imu::imu_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tof/src/imu.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff021e55f68b97f1d06c32a3956a81f9148ab50081d91167040561be26d043a"}},{"ruleId":"D2","level":"warning","message":{"text":"traits.status (cognitive 16): traits.status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 4, ternaries 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":"spaces/vetbook/traits.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db694360e9881ff903d9d61f63f36a6b79d4caeb23610beb0e07012b5645d85"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.handle (cognitive 16): Session.handle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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":"spaces/policy-playground/web/src/rendezvous.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e726c7ad58f5d727a12791fb8ec0f4f83372ea485dccf883648d050960527e"}},{"ruleId":"D2","level":"warning","message":{"text":"main.card (cognitive 16): main.card has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 4 (5 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/web/src/main.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"185b5d8e5fabca825795d4b37e494841e9f4889dc75c6e1a1c227dab10f5a402"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotd::control_loop: FunctionTooLong \u2014 robotd::control_loop runs 1273 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1173 over it, 12.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":"robotd/src/main.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9408255edb4fc35297223678d413a0f8d7d679842265296c3f698eff40725452"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 3432 significant 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 56 free functions. The bar is 500 significant lines; this is 2932 over it, 6.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":"robotd/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0373d66b80f05701f6dc6de29aef57a101799738d782d2780c74b4476f8bc21b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 3387 significant 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 92 free functions. The bar is 500 significant lines; this is 2887 over it, 6.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":"robotctl/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47318deb701572a21e6720d315d07b574174b1abf917abaedac46d7af89e030c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Brain.step: MethodTooLong \u2014 step runs 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 536 over it, 6.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":"autod/src/brain.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f575527dd2805a09e13ca00ce4316725fb5fa44ec3e73315b18f16eb6dec5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2718 significant 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 2218 over it, 5.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-ipc-proto/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fa7949c78418ed41037313f8823619969b120112c441f34646df4e7fdcad10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/monitor.rs: FileTooLong \u2014 1829 significant 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 1329 over it, 3.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":"robotctl/src/monitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf4f36a261826997684126791d90773a27ae7a776a1001c1a54e7bfd31c4f6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1748 significant 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 1248 over it, 3.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":"robotd-params/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdfa6ad275b2ebe1470e0c76d31bf202d7c06425240dc5754ce90fb7ed71ff0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: duckctl::run: FunctionTooLong \u2014 duckctl::run runs 348 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 248 over it, 3.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":"duckctl/src/main.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5b3743b4c55b7c92146dd05252234b01d1379f4f263f638871fcf1d9329617"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine.rs: FileTooLong \u2014 1675 significant 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: Engine (2 blocks, 188-2628). The bar is 500 significant lines; this is 1175 over it, 3.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":"updater/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce18db45692c5363f14056693fd576307c94b8e1244b3103e60c1728c114f397"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 1626 significant 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 52 free functions. The bar is 500 significant lines; this is 1126 over it, 3.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a10589f8479abe0544ed2eb8a49f79af959e49937408306c85033bdfc1bbd1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mediad::main: FunctionTooLong \u2014 mediad::main runs 310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 210 over it, 3.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":"mediad/src/main.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc97001d6e04fb8bc4650e561aee733d88e1439ce813e2d33030f0154a62ef8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Engine: ClassTooLong \u2014 1223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 2 blocks, lines 188-2628. The bar is 400 significant lines; this is 823 over it, 3.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/engine.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"de87d64528680979d21e04ae200625ff5abd33b5626ae13380a3b5beab2c1a9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: autod::drive: FunctionTooLong \u2014 autod::drive runs 293 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/main.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f735a9b6b688b51b0ea55e75524d5a597604d926f89b5be83ddef9112544bd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Brain: ClassTooLong \u2014 1145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 2 blocks, lines 395-2045. The bar is 400 significant lines; this is 745 over it, 2.86\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":"autod/src/brain.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c381c845bdc925135ea9b7e336c241548f1c40d23e1f51d41fd8b63e6a87bc4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotd::dispatch: FunctionTooLong \u2014 robotd::dispatch runs 278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":5853}}}],"partialFingerprints":{"codehealthFindingId/v1":"2812b98a82a477961994ecaa07b7f1290ff8a94e21d22d55b7c08a72f5d17342"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.dispatch: MethodTooLong \u2014 dispatch runs 278 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/ipc.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e304ff434672cc72fc65ab84f760042ab38f971d8f79dc56decf0b7c23d0d63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/brain.rs: FileTooLong \u2014 1329 significant 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: Brain (2 blocks, 395-2045). The bar is 500 significant lines; this is 829 over it, 2.66\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/brain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7637620841081c90febb64933ffe89bbdc3822be702674a3c5195da8fae042cf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Mapper: ClassTooLong \u2014 1005 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 45 methods, 2 blocks, lines 403-1821. The bar is 400 significant lines; this is 605 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":"maploc/src/mapper.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0d945c8fdea8c720103d3cf73a1d683fa4b8dfaee19ce2fc93883529ab633a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: View: ClassTooLong \u2014 996 significant 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, 2 blocks, lines 1432-3214. The bar is 400 significant lines; this is 596 over it, 2.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/monitor.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4045a67a6e9bbf97ef7f91e547221afc3370d88889855736c7ed931f2a2f978"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mapper.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), about 82% of them inside a single declaration: Mapper (2 blocks, 403-1821). The bar is 500 significant lines; this is 731 over it, 2.46\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":"maploc/src/mapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9d8a6fc0006e1fe70af1a0a3825a0050f169f0e8da3a83fd429dec27ca558b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vetbook.rs: FileTooLong \u2014 1222 significant 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 722 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/vetbook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"622dc877eb80ea9d36690f1ad57fb4281cfcaf25170c7db7c88ef5cece06b3dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pipeline.rs: FileTooLong \u2014 1211 significant 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 711 over it, 2.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":"mediad/src/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8456db1b051ddeb338a32bc67430974b57091202fb32adb3d7def6c300bf298"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/registry.rs: FileTooLong \u2014 1097 significant 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 597 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd-params/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f3552a023c6d1b0749fdd85052ed55bce517f758c6e86eb7430ced4e79c8ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Brain: TooManyFields \u2014 64 stored fields beside 25 methods. The bar is 30 stored fields; this is 34 over it, 2.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/brain.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c7a0d2cdb56b44031bc949bc1e05b530b5e92946527a4b2f2d67e598468a0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: btd::bluez::serve_on_an_adapter: FunctionTooLong \u2014 btd::bluez::serve_on_an_adapter 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":"btd/src/bluez.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"503cedbde4ce305d8dffcf2dd55cfc9fc934fb97aae519a97171e2fba67f44f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: padd::main: FunctionTooLong \u2014 padd::main 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":"padd/src/main.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"af71d6b89b4443fe4d1de6d0e4ae3c28f6e9b0eccaee1a73acfa6c063b47e033"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: duckctl::udp_pad::run: FunctionTooLong \u2014 duckctl::udp_pad::run runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/udp_pad.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e4c91a1668692cca2670b591804ffbddb30e1fdf6f85ce774ce3cf678bdd2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MapperConfig: TooManyFields \u2014 60 stored fields. The bar is 30 stored fields; this is 30 over it, 2.00\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/mapper.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93d1e0450ded1ccae4c711a8d333dc366973b66e169c940c2a348013fe78c0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotctl::configure::run: FunctionTooLong \u2014 robotctl::configure::run 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":"robotctl/src/configure.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc13d6e95a6de7a38f4a307799eedabf0911c4d6944fc2f6f94b8b71cd327da8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: netpadd::serve: FunctionTooLong \u2014 netpadd::serve 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":"netpadd/src/main.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a84f72c5381bcb5f9a915198e542394a5b8a1eebd27af0cda31b34434f525a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.stage_and_swap: MethodTooLong \u2014 stage_and_swap 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":"updater/src/engine.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e7fe1e2f79fea5d9ad6ff4e38d98127629debf242c4e0ebaac1cc9a7efa0bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/endurance.rs: FileTooLong \u2014 899 significant 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 399 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/endurance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"056bfb4a61de7ef931540a9af566664705eb4d6f71c19c5cb87ebd1fe2134761"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mediad::pipeline::start: FunctionTooLong \u2014 mediad::pipeline::start runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/pipeline.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d438cb23eec2bf9b047544da758bff90b89d09c2189b30cad9c6d4b339ee14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: duckctl::request_line: FunctionTooLong \u2014 duckctl::request_line runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/main.rs"},"region":{"startLine":2850}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae19706d7a9a5d053d35af485429b91868c762ccbb1941c23383fa312f4844a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotctl::configure::draw: FunctionTooLong \u2014 robotctl::configure::draw runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/configure.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"52320a0a7c7eec62f48276ea17d5c49f5509c4de4e247b1f7bbb218faa0323fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RobotState: TooManyFields \u2014 51 stored fields beside 7 methods. The bar is 30 stored fields; this is 21 over it, 1.70\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a175b18fe00f280de21112e537acb5f3f3f86ee5fee732f0d991829823b291"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webclient/index.html: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 342 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"393b2f7d4433b71ebba7d81079aebb80837cd9c4ccee0681b5b9448b094e8cab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Engine: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/engine.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf20decadd961d7b53c26f102d68381eaaf0ddfeb2db9e5e6d074d0dab4200e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Server: ClassTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 2 blocks, lines 100-1206. The bar is 400 significant lines; this is 239 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":"updater/src/ipc.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af85d0c87f3b1ac8106b6801c801fcae3526142f23df48ea7628d1e18b2f02d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Page: ClassTooLong \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), 8 methods, 2 blocks, lines 215-1219. The bar is 400 significant lines; this is 238 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":"robotctl/src/vetbook.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e0a57582fdde9e80368e7b69da09554f05fb6e56d1eb1a92433b365cd4e8b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 786 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 286 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a8b9ff7ae4350eca9b51037165f744eb7f5d9b1c96939f9844e88a49d5aa37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: View: 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":"robotctl/src/monitor.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeafdcfbc8c6a3aba504b2fb5552bae4adeca7bd23c8e673add9f874f0632593"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Intents: 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":"robotd/src/intents.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f46d5eec0a369ffd7502cdd3f28ca2e596e4ed7f91a90289965c7b737e7a1a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotctl::render_health: FunctionTooLong \u2014 robotctl::render_health 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":"robotctl/src/main.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"af659b5d26ea730e7d2a4f0853671416f6aaddcd099b76628d07eb1051bc4bc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mapper.tick: MethodTooLong \u2014 tick 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":"pad-map/src/mapper.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd6bfc8ad0a68ee45875aa414c6e98623d6a0cfe10f7d6dd52a32197f2f1165"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/relay.rs: FileTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 253 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/relay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b0dd4cf04918284f4d478ca70140c565007dcc43f7fea1513de717413913a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Mapper: 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":"maploc/src/mapper.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6367a6f4923d3906954cb90744e79abdec7d839f7ce92e8866a6fef741b11e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotctl::run: FunctionTooLong \u2014 robotctl::run 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":"robotctl/src/main.rs"},"region":{"startLine":5828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1bf61a8bcce5ab273095a9f8b9f902181980ac40e898be59cbc62b958692b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mapper.search_once: MethodTooLong \u2014 search_once 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":"maploc/src/mapper.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"815fbb2ca8e7eaea21ed24dbb467ac41afe4d910c0a66edd491e6a39f2e007b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Controller.step: MethodTooLong \u2014 step 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":"robotd/src/control.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"826ecb323604a7377db2b746369a91d582d7fbc3a80322064d5c9362222b436e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mapper.track: MethodTooLong \u2014 track 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":"maploc/src/mapper.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"542270b66c59022475dc1b5db9c9972c3850bd86fd91b6c8741bdf8f393bc196"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ipc.rs: FileTooLong \u2014 691 significant 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: Server (2 blocks, 100-1206). The bar is 500 significant lines; this is 191 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/ipc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f5c49537ff70f8747f8009611aacbe96beb631ee69990d6fac43fc5f97373c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: updater::install: FunctionTooLong \u2014 updater::install runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"updater/src/main.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a5650f262cb1a1a3c990402b906113018f39192e79134a580664e36b89f79a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/edit.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":"robotd-params/src/edit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35fb0e33232a64e5da664d6df114927212b7d77e2aa8f1f5bd8e30b77d92273"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sounds::chorale::midi::parse: FunctionTooLong \u2014 sounds::chorale::midi::parse 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":"sounds/src/chorale/midi.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"631a4cb9297323416fa166ab8bd360e553963b8aea90eac1969e84d15c9d1137"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/configure.rs: FileTooLong \u2014 649 significant 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 149 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/configure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a760c6b7be2a9b1fe8aa93f9f4c4165869c0623e6894dcd5a7b3278327ecaab"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Call: ClassTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 2 blocks, lines 1343-2192. The bar is 400 significant lines; this is 114 over it, 1.29\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-ipc-proto/src/lib.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0575e38593026d268ad39ffbabbe1a9c78a60a826c5f58ef3beaacddc70c0da1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sounds::main: FunctionTooLong \u2014 sounds::main 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":"sounds/src/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c3c577257a126ce65084417afcf885b93f078caea6610a2fc9aec6c21587ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: duck_detect::bin::duck-bench::main: FunctionTooLong \u2014 duck_detect::bin::duck-bench::main 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":"duck-detect/src/bin/duck-bench.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb82dbe9642b9842dd68c79f43c4c465d95084ccbb69cbb73eec16eec316c4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Page.render_life: MethodTooLong \u2014 render_life 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":"robotctl/src/vetbook.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e214e531b60ec019a7aa228e76b67ff4bcb0605b5bbc9657f588a0752adf7b7a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Mapper: TooManyFields \u2014 36 stored fields beside 45 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/mapper.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c2c38de1542ad1a47007153796f5bff1ce41aa3c07348eba477943d0f10079"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetworkManager.connect: MethodTooLong \u2014 connect 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":"configd/src/nm.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37ed64419d670f6ff2bb985e122c396b1afb8913ee2520288c65e02d91f8d69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotctl::run_policy: FunctionTooLong \u2014 robotctl::run_policy 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":"robotctl/src/main.rs"},"region":{"startLine":4353}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa921b054fd48a6f958851e784cf54279d7a1c1d674c7d2a4f616942f96da66"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Life: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-ipc-proto/src/vetbook.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7551b4e6d45f1f1a05161f71592db86b6f8d83c9dc63d42ae5cbb0bba1435b13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlueZ.pair: MethodTooLong \u2014 pair 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":"configd/src/bluez.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b53656c492c64ecff3258bd5b8b003cb4d65844ded861170f36641a4888af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DynamixelIo.check_registers_of: MethodTooLong \u2014 check_registers_of 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":"duck-control/src/bus.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b6a61988251ddbf5797f268bd049fd96b3e610c0beb2b81417fa2f00157fc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Params.validate: MethodTooLong \u2014 validate 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":"robotd-params/src/lib.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"978d387a0aee42268b4df3121e6e785ed8c6098c140e6a5d7083f76436e951cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: duckctl::udp_pad::panel::render_robot: FunctionTooLong \u2014 duckctl::udp_pad::panel::render_robot 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":"duckctl/src/udp_pad/panel.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba82500c5b1c81262764e22fb5eedfec2c1d65502a8c31661a1fba3c1df22be5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xtask::package: FunctionTooLong \u2014 xtask::package 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":"xtask/src/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccba6953efac53efb3ee9e1a5db06c8fb77ff7ffb2c8dac62bac9ffce0e1c1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bluez.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), about 63% of them inside a single declaration: BlueZ (3 blocks, 547-1337). The bar is 500 significant lines; this is 80 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":"configd/src/bluez.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b1a392137129f4eed8be3b52abbacba6db110a89cb1dfd4073030e9b832054"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.recover_on_start: MethodTooLong \u2014 recover_on_start 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":"updater/src/engine.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22425b09cfbf24bcb18ba05a04084a3ade365bd578ea0fb45a8cf7721b7019b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Call.parse: MethodTooLong \u2014 parse 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":"duck-ipc-proto/src/lib.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac51d9e58abb5c9b3b88af3fd5b147cb784aa47fc0e2283f90284834021d56ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SoccerParams: TooManyFields \u2014 34 stored fields beside 2 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd-params/src/lib.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61664c58720cada8f55225e2979b5f7113a499bacb6b4395903709eba38b8a0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DynamixelIo: ClassTooLong \u2014 446 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 3 blocks, lines 122-898. The bar is 400 significant lines; this is 46 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-control/src/bus.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccd52798d6b414d5220bdbc042628cf8f04c7199284f3417fef44b9fbf72293"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotd::handle: FunctionTooLong \u2014 robotd::handle 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":"robotd/src/main.rs"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"2404cdbc14aa9b8dc7b1375733fe0c21105e83ecf70d39d90b1f4c3edbe50f83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tracker.tick: MethodTooLong \u2014 tick 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":"robotd/src/vetbook.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd4f640c117f2872832d97e41a6dbb8692b79268f0fbac1f2584e8cc2c7141d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: udp_pad/panel.rs: FileTooLong \u2014 553 significant 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 53 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/udp_pad/panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33fe7ec8bebe90742158e17ca42e32444eda25ecfa854a830f8502f951d006b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.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":"nfc/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7c06d01f9ff2289b71af7f85fd34206f63e0c19c31ea213c606b671f5e5108"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.open: MethodTooLong \u2014 open runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-detect/src/rknn.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8cd3f016607669b94267f347145f2b7baa55a9b8cc52ad01a6a1be57e5ec71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/policy.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 40 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":"updater/src/policy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eda9012eab7c72c211fca110412c0a25efae80badedd4819b523485ef71228"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mediad::pipeline::build_stream_branch: FunctionTooLong \u2014 mediad::pipeline::build_stream_branch 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":"mediad/src/pipeline.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce67b4998b6616e029e559ced933994810fd7cf39a31236683623bc49091a98d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotd::main: FunctionTooLong \u2014 robotd::main 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":"robotd/src/main.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bdee29068876f87c5de944eb16b40745c5cf2d106ec876ca5b21934d745934"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: View: TooManyFields \u2014 32 stored fields beside 47 methods. 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":"robotctl/src/monitor.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"c211094c6fb00f444d2a089d5cbaa6a47d432585fa178f70f96860d4c4023a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.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":"tof/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13477c26ed79b169ce4b95655bb6d6387c8c6d48d288916255823da3c2c32f3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Sound: ClassTooLong \u2014 414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 174-872. The bar is 400 significant lines; this is 14 over it, 1.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":"robotd/src/sound.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ba71a41979927eca019d6620e28f7861027e33c5336e9e8000052377e78291"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56561eeef77ca62da16a3939c81ffeab8ff86effffd40cf95bff3eb7fa8592fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotctl::run_policy_skill: FunctionTooLong \u2014 robotctl::run_policy_skill 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":"robotctl/src/main.rs"},"region":{"startLine":4628}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b1b406aabb4c9c68c482188dba4b682211aa07016bd3929c0e2c35333fb6ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: robotctl::vetbook::live: FunctionTooLong \u2014 robotctl::vetbook::live 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":"robotctl/src/vetbook.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7d8492fe3c194573284dd18c22bf4817979b6956dc796f126028bb3f033526"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tap.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"padd/src/tap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcb63a19414054b0104406cf92f57e7823f213ca063efa3279f40c60fac9ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 20 shared lines): mapd/src/main.rs:304-325 | mediad/src/frame.rs:355-379 | nfc/src/main.rs:731-753 | padd/src/tap.rs:944-968 | tof/src/main.rs:815-840 \u2014 These 5 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mapd/src/main.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"267bc7d05940de11ba848d533d78bc1bd9fbc413192e3c03a78357b81278a4fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (74 shared lines): robotd/src/laser.rs:381-471 | robotd/src/soccer.rs:576-662 \u2014 These two members are variants of one another: 74 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":"robotd/src/laser.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81898a08108c418964d72199c33f0d3e0be0658909d8953713d6631405cbf10"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): robotd/src/sound.rs:375-481 | robotd/src/sound.rs:492-596 \u2014 These two members are variants of one another: 45 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":"robotd/src/sound.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63034c93d69e10bb27ff8ed1a893868538eece27e95b2e0a2fc673154f902f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): pad-imu/src/lib.rs:332-351 | robotctl/src/duck.rs:225-248 \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":"pad-imu/src/lib.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee813a7bb52f7bd1bd7881c045549b05af25f9c398d092d9e98f93f237628ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): autod/src/main.rs:108-134 | mediad/src/main.rs:198-797 | nfc/src/main.rs:116-179 | updater/src/main.rs:213-236 \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":"autod/src/main.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9487613aed88c78acdd810848f9c9f9c949c0f52eaea8f41afb703595d4f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): btd/src/main.rs:215-229 | configd/src/main.rs:671-685 | robotd/src/main.rs:6389-6406 | updater/src/main.rs:700-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":"btd/src/main.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d5da73d70a99c7e2fb1c08de41cd46be1356483c823d7dddd46efb9cea6667"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): robotctl/src/main.rs:898-995 | robotctl/src/main.rs:1001-1069 | robotctl/src/main.rs:1140-1223 | robotctl/src/main.rs:1282-1393 \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":"robotctl/src/main.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb245a1c819788ae5ff5ad070d2db3278a4bf4b666029fc826e4645e6ae68ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): uyvy/src/lib.rs:103-156 | uyvy/src/lib.rs:181-222 \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":"uyvy/src/lib.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a501ce3b18ea7d51ddc50cff40364a1e2089452e2134aff43624bd9654a971b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): configd/src/main.rs:425-469 | updater/src/ipc.rs:496-549 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c6604fe70eab3cdacf093b7bc63f484d4003441e363959c142cbb307eb2dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): robotctl/src/main.rs:1073-1109 | robotctl/src/main.rs:1227-1275 \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":"robotctl/src/main.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bda3d88545c474ce4796b9c7cb44746fa09aefc9d94cecda2d761878638a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): btd/src/upstream.rs:212-252 | mediad/src/upstream.rs:170-209 \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":"btd/src/upstream.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2cead3dcf85f1004fa2c96bd85bcb092d7df4ac0988db6963eef4c327d0ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): robotctl/src/main.rs:4567-4603 | robotctl/src/main.rs:4840-4870 \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":"robotctl/src/main.rs"},"region":{"startLine":4567}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8ca0aed837bac9ce38360a7e3eaf99bbe48204ef74d91206a2edd98a3716ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): sounds/src/voices.rs:64-90 | sounds/src/voices.rs:151-172 \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":"sounds/src/voices.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca5313594c79c8d24c3a3d97624e3b38a0b3118a3c0646f6c4ac0433c117e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): sounds/src/voices.rs:126-149 | sounds/src/voices.rs:280-316 \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":"sounds/src/voices.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0326ef42a2e8dd56fea9a2c0559ffc5ad177602472d8fb8ef69360541f02fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): robotctl/src/path_map.rs:280-305 | robotctl/src/path_map.rs:348-374 \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":"robotctl/src/path_map.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb839c79c9ef04e92edba161de4b98fd30db3e8bca5c04dc2198c4175467d43b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): robotd/src/soc.rs:99-128 | robotd/src/soc.rs:138-172 \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":"robotd/src/soc.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"016ea30a6f01b61f7caa0bfd40d388bea95af1c22b61d951afe6f3012ac861b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): configd/src/nm.rs:262-289 | configd/src/nm.rs:296-319 \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":"configd/src/nm.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfb0e3aa50fa96769946368ba4e5046083e44e0022e1ed2d8649ab559c94a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): robotd/src/laser.rs:316-337 | robotd/src/soccer.rs:518-538 \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":"robotd/src/laser.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f415c378e57c7a90a923b0632fac6fe7afea5ef9ebaa08151dfbd4750e800f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): robotctl/src/monitor.rs:554-582 | robotctl/src/monitor.rs:778-813 \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":"robotctl/src/monitor.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"9122f26bb7f51cc7bb9bcbe981f6cce6fe9dcd30fde7fa72938202199d5afd9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pad-imu/src/lib.rs:392-399 | robotd/src/head_imu.rs:130-137 \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":"pad-imu/src/lib.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"af983e105b572f56b2007dfc39e2886d23b0906bae117463b1fa690af70cdedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): nfc/src/main.rs:671-699 | nfc/src/main.rs:707-728 \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":"nfc/src/main.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8efc1e6a641ef0157a1fb26609ed82fe2c7517c883a2739d1945bfc328178b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): robotctl/src/cells.rs:18-40 | robotctl/src/imu_view.rs:189-215 \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":"robotctl/src/cells.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0672545a9fdf864dea202a9bbeea84c7c8675d477b3003d64f74a357ed4f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): netpadd/src/robotd.rs:55-75 | padd/src/main.rs:645-665 \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":"netpadd/src/robotd.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bee2b6b5704c8166b4cf0456bc35465fec0f7a11b82ae57ce3c1fae30e6273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): robotd/src/laser.rs:345-373 | robotd/src/soccer.rs:546-568 \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":"robotd/src/laser.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30573635d3d1d053c7ab0753ddb7735566836b3188786629aa86229f9fb7ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): mediad/src/ball.rs:273-296 | mediad/src/laser.rs:302-325 \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":"mediad/src/ball.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d62f46d53295e2ac954b3358f19f22b220578efeac659f3deeb2ac0e52824b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): tof/src/main.rs:767-786 | tof/src/main.rs:792-811 \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":"tof/src/main.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e7f54ebd82126f49d6aa5410b0898babe52bdcc820883aa76fc8d763b0c6ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): robotctl/src/configure.rs:851-868 | robotctl/src/configure.rs:871-887 \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":"robotctl/src/configure.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9282c7d980eea63257f42ebbcf29d0e1d402eccce1b05f1d8fa33d5c07eb67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): robotctl/src/main.rs:2976-2989 | robotctl/src/show.rs:386-410 \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":"robotctl/src/main.rs"},"region":{"startLine":2976}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7b6735c871995e604d5da9c2d1b4783ebca98ba203e12ee58250411d285ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): updater/src/journal.rs:237-260 | updater/src/journal.rs:493-509 \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":"updater/src/journal.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98cbf6f1f9e539e6aae9502cd2011ccf7c957c2ee7efb845e5dcf065348f84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): robotctl/src/setup_code.rs:354-368 | robotctl/src/vetbook.rs:1224-1237 \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":"robotctl/src/setup_code.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1f2ab843d18318911b878317c6ae12fee370c997bc01dea72042eceee1ad4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): duck-control/src/bus.rs:820-837 | duck-control/src/bus.rs:839-862 \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":"duck-control/src/bus.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40b32875e6343be83fd4d7b3777c3f5c3e25478bf5d3e8617d7c1a9c13059ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): duckctl/src/udp_pad/panel.rs:357-376 | robotctl/src/monitor.rs:3259-3278 \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":"duckctl/src/udp_pad/panel.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bdb370d071f74d458ca5d95d8818230127f0d62628981bb67b22960a9d927a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): updater/src/journal.rs:100-116 | updater/src/transcript.rs:188-208 \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":"updater/src/journal.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ccc0a48cfacfb0b016e8a49419917770940a73234c6cbbd653642294d949c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): updater/src/engine.rs:1536-1547 | updater/src/engine.rs:1551-1565 \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":"updater/src/engine.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c5689238bbb7f588abd10fc875dfecbf769298bbd1d164e58dd020c7bd0f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): robotctl/src/main.rs:769-785 | robotctl/src/vetbook.rs:158-174 \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":"robotctl/src/main.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ac837fa6a3e6724e61929dc436d81b9174ec64dc87ad0cb2dfe935e0c991e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pad-map/src/wire.rs:65-77 | pad-map/src/wire.rs:220-230 \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":"pad-map/src/wire.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fd76560e6344c09753584fd620ae04f4cd6e5635544a305cf4e1876eef4a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): updater/src/source/github.rs:317-335 | updater/src/source/hf_hub.rs:67-82 \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":"updater/src/source/github.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10e1f58fd10084514ab25ca43dd5b859e003ed0aff96e62ac4f065c2d4a2365"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): robotd/src/main.rs:338-351 | robotd/src/main.rs:1979-1992 \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":"robotd/src/main.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"643432a5eff59b14547f9704e8235c50d3372615c77f385ff0e3fbe4e9e35854"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): duckctl/src/main.rs:682-690 | duckctl/src/setup_code.rs:79-86 \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":"duckctl/src/main.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"30667e836c7ce22295877f6fb372c13d7bdda663278b60a821b5474d062ad4e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): duck-control/src/imu.rs:176-186 | robotd/src/head_imu.rs:195-205 \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":"duck-control/src/imu.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffd3b845ce3958e37811ef23f59dea29a0261520dd38410843f732d1f2d0a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): configd/src/main.rs:113-133 | updater/src/ipc.rs:78-97 \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":"configd/src/main.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"364249b4620042b19c08fa8d28a631dc07bc7b59a9e0706df09b082fe43a5830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): duck-auth/src/tcp.rs:46-59 | duck-auth/src/tcp.rs:66-77 \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":"duck-auth/src/tcp.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d62cf8c9173579b6f212aadb04cb42ac59b071085d52f5991fee950c9caa30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): configd/src/main.rs:141-156 | configd/src/main.rs:158-172 \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":"configd/src/main.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec5f26a6820b59eb726624ba98e4c380277be484bcd44cbdd4a023b1ef717b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): duck-control/src/imu.rs:200-207 | duck-control/src/imu.rs:210-217 \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":"duck-control/src/imu.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c8467b1ed275661a010ac6cd36d64c053f7af1cd265d00f61a2f8567a44ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): mediad/src/turn.rs:314-328 | updater/src/source/http.rs:384-398 \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":"mediad/src/turn.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dd1e77865f53c9579444c2a69ca9412129fded95674aedde07ec21276d1935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): robotd-params/src/lib.rs:2638-2650 | robotd-params/src/lib.rs:3205-3217 \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":"robotd-params/src/lib.rs"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"32800f748314cf969e1621a1f4aa95969178015ea1eeda007dc309b20d0dbc81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): kinematics/src/mjcf.rs:223-231 | pad-imu/src/lib.rs:376-382 \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":"kinematics/src/mjcf.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c233991a30d71f848b74689fef5d837a7f88f84ce731ecddbd0f33411a5d85b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nfc/src/vtag.rs:81-89 | nfc/src/vtag.rs:149-159 \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":"nfc/src/vtag.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefa4eb171db584eac24d2316486f8ffa8a5ae962b77edfa666ea35f07046561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): robotd/src/laser.rs:112-123 | robotd/src/soccer.rs:169-180 \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":"robotd/src/laser.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7849466728050bae21a8e518ad500c2f9aad81c05f4aaf1cda92bead08b87b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): pet-detect/src/worker.rs:354-364 | tof/src/main.rs:595-605 \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":"pet-detect/src/worker.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3621d3f48d3384871a5812c976a2048cc8c4bd19ab8243bf23094d91d704229b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): netpadd/src/main.rs:543-550 | padd/src/main.rs:619-626 \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":"netpadd/src/main.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80b24d051fbf220748ee4077b672fac47fc97f73186a0f5a1f356d3569c6e78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mediad/src/laser.rs:62-73 | mediad/src/laser.rs:76-84 \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":"mediad/src/laser.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"875036309723e4907d0ac043540fb2d57c206eb893216e56a0564b799dd13f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): configd/src/main.rs:342-356 | configd/src/main.rs:368-377 \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":"configd/src/main.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdd3d90efd579c5d75794b2938aa4c7825561b68552f245799f296f6937e289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): configd/src/main.rs:662-668 | robotd/src/main.rs:6380-6386 | updater/src/ipc.rs:1240-1246 \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":"configd/src/main.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0361ec741714a53d0e1473065218e5325aaa8c30e8998042ea822fac9dbd1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pad-imu/src/lib.rs:384-390 | robotctl/src/duck.rs:265-271 \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":"pad-imu/src/lib.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8a1cdcac2b2ae7ff5c8b19f4c077ebae9ac4824b5be3aaa20725e0f9710c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): robotd/src/head_imu.rs:475-483 | tof/src/imu.rs:266-275 \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":"robotd/src/head_imu.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6245ca8fbc27594ecdb06148decb81fbd93db26a93db3da3e5184622591d3a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): duck-auth/src/lib.rs:101-109 | duck-auth/src/lib.rs:111-119 \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":"duck-auth/src/lib.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed11841a0fa44f2b9cdfd7366b53b180354eff386b1ac2b3829a91c05e352b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): test-support/src/lib.rs:256-263 | xtask/src/main.rs:848-858 \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":"test-support/src/lib.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4befeb2eeb67a813917fd18e0d3f9f2df863ba3dd4f1032e53c30777ccd86c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): padd/src/tap.rs:357-370 | padd/src/tap.rs:388-401 \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":"padd/src/tap.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf6da66c7261e5d8f7a5bb34e4a4c37c0323070824b1c285c4f0e02bf039afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): configd/src/net.rs:378-388 | configd/src/pad.rs:332-341 \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":"configd/src/net.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ee404d5319bbdbf0573be4c27f48288dae28f6d370b1a19a292cfc8f551332"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): updater/src/unix.rs:17-27 | updater/src/unix.rs:30-38 \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":"updater/src/unix.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"549e2b85ebb599379f6db5f833fdf4cfaa3085ef457fefcdde9cf4860936f834"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): updater/src/policy.rs:1287-1292 | updater/src/policy.rs:1640-1646 \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":"updater/src/policy.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"127a1bc15a04ea591152ff2ca46dffb38fcc95b26560d4ad5bf49b7553097208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): autod/src/map.rs:22-25 | autod/src/obstacle.rs:187-193 \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":"autod/src/map.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d997b83b11bfdd5c951a247b259338bdecb153220e19c9860d3225c901ab15eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): nfc/src/tag.rs:101-110 | nfc/src/tag.rs:113-125 \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":"nfc/src/tag.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8af1c3fb2af30a331db9be6e96b3ad2390002f79168cd7d894468be2af6258"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): robotd-params/src/label.rs:122-128 | robotd-params/src/lib.rs:141-147 \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":"robotd-params/src/label.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb2af90b3aa54ec2b5aa2801c09e6e8cda5a27dffc25c26c19a0bd80ddb3360"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): mediad/src/config.rs:31-43 | tof/src/config.rs:28-40 \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":"mediad/src/config.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bb5d165a232063e4624276eb48cfb5d1282f487283739071a6a6ed5d245c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): maploc/src/se2.rs:31-38 | maploc/src/se2.rs:40-47 \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":"maploc/src/se2.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"347b65162731eb0c5cb5a3058c969027c217076deee3e8436ca2e52da922af93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): robotd/src/head_imu.rs:247-255 | tof/src/imu.rs:120-128 \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":"robotd/src/head_imu.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb7ca02b9aefc16133c4db6276116cff6c814b23f17e94daa0e2b005832ff39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): pad-imu/src/lib.rs:368-374 | robotctl/src/duck.rs:277-283 \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":"pad-imu/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e8f818b29cbd18cd07a88e45c81209aeb2a7a2b1c197e9074e0a60b963ed69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): spaces/shared/control.py:47-50 | spaces/vision-demo/control.py:47-50 \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":"spaces/shared/control.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a249460fa18d9941859f59f2264cf0463fef2f5f1cca64c77539e4a39c1adaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): updater/src/verify.rs:298-304 | xtask/src/main.rs:860-869 \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":"updater/src/verify.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3f05145576297e16a975382d4cc7feb199b9b10505072f501b0103965456b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): duckctl/src/main.rs:1693-1701 | xtask/src/main.rs:201-209 \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":"duckctl/src/main.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfe7f2e075347f51d23713465567bc0e33a64a57a3ee9460e4f22b5dac24f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): mediad/src/ball.rs:55-59 | mediad/src/laser.rs:125-129 \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":"mediad/src/ball.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcd6f28639ccaaab5975f076089f3f5429865e19b0cca484f1dd629c305e6da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): robotctl/src/endurance.rs:147-156 | robotctl/src/setup_code.rs:126-135 \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":"robotctl/src/endurance.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c787dbbbf3a8aef619fa20a4cfc975b07b0a0b33b4518d9f22f618f5203d9916"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): btd/src/main.rs:160-163 | duck-gateway/src/main.rs:89-92 \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":"btd/src/main.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"142ba142bf6f90af27800c3dabade58178a452d1679ecea043b159facb8dba45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): netpadd/src/robotd.rs:45-49 | padd/src/main.rs:629-634 \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":"netpadd/src/robotd.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6677bfa285ad6e805dfd5400de6d65b9433e19a65efeb60344f958d38520899"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): mediad/src/sensor.rs:307-313 | robotd-params/src/lib.rs:2562-2568 \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":"mediad/src/sensor.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafa3458c03f35e10d5204dea2e0dcd9b4ac86328cc59887c2705571f628cc15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): autod/src/main.rs:619-623 | robotctl/src/endurance.rs:489-493 \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":"autod/src/main.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8501ccb89aa44380c464f092528240d6b1473573cd66f21e878c867234bf2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): robotd/src/sound.rs:447-471 | robotd/src/sound.rs:569-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotd/src/sound.rs:447\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":"robotd/src/sound.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd3e108e7dd3d1a09fc38f1ccfb26d37d604d6c0c422df4e438344700e4edf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): mapd/src/server.rs:64-83 | tof/src/main.rs:695-718 \u2014 before extracting anything, compare \u0060mapd/src/server.rs\u0060 and \u0060tof/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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 \u0060mapd/src/server.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":"mapd/src/server.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f479a9900a380e2d9d4cee29e9af4e92168d5114d3b7388bfdf619fd0094ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): robotd/src/laser.rs:416-439 | robotd/src/soccer.rs:611-630 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:416\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/laser.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c166287e9aa690478b87c34bfd00914000c1b3ff1c5626977fa968ff2696af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): robotd/src/main.rs:2829-2851 | robotd/src/main.rs:2896-2917 \u2014 both copies are in the same file, so extract the block 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":"robotd/src/main.rs"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedd0e4964fc187c4f4e462fab6004ae6428c4badca54380c37d8f42beed7b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): uyvy/src/lib.rs:121-141 | uyvy/src/lib.rs:192-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060uyvy/src/lib.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uyvy/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb52d101a5041e67d759e5e07e18b852683a04f9366166373ea32ed5fa943d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): btd/src/upstream.rs:191-210 | mediad/src/upstream.rs:149-168 \u2014 before extracting anything, compare \u0060btd/src/upstream.rs\u0060 and \u0060mediad/src/upstream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key\u0060 to \u0060(Upstream, Lane)\u0060 in one and \u0060(proto::Service, proto::Lane)\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":"btd/src/upstream.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6990cb88f9370712aaf07c13afe78bade2f21cff1ec26f6c54fd5ad8ec23b02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): maploc/src/field.rs:98-116 | maploc/src/grid.rs:66-84 \u2014 before extracting anything, compare \u0060maploc/src/field.rs\u0060 and \u0060maploc/src/grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/field.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f24fd14748ab3c95c4ecf6d8761caadee2e35ceff8f44ef4381024f1ee1626f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): robotctl/src/main.rs:4568-4588 | robotctl/src/main.rs:4841-4860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/main.rs:4568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":4568}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0437204881491453a234ee8e5613ad66ca52dbb967ec225c110001f6ed9991e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): robotd/src/sound.rs:394-412 | robotd/src/sound.rs:633-651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotd/src/sound.rs:394\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/sound.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31b4fec0c47f866382d84e5fd915be47c3830393eda1a7132677cca8e5cc7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 5): mapd/src/main.rs:305-319 | mediad/src/frame.rs:356-373 | nfc/src/main.rs:732-747 | padd/src/tap.rs:945-962 | tof/src/main.rs:816-833 \u2014 before extracting anything, compare \u0060mapd/src/main.rs\u0060 and \u0060tof/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 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":"mapd/src/main.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"750d919ba9b3cf5ace52091d5ea565ae6596f77ed20839ae96f15898124e79db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): btd/src/upstream.rs:168-184 | mediad/src/upstream.rs:127-143 \u2014 before extracting anything, compare \u0060btd/src/upstream.rs\u0060 and \u0060mediad/src/upstream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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":"btd/src/upstream.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e44818dadef4e44db09fbfe775018606152a90a48fdec553a345ee7e004338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): duckctl/src/udp_pad/panel.rs:360-376 | robotctl/src/monitor.rs:3262-3278 \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 \u0060duckctl/src/udp_pad/panel.rs:360\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":"duckctl/src/udp_pad/panel.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5684361e020736cf44d45ecf1c1012b13654a20a6d2af4bcf24c1e5e2b646b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): pad-imu/src/lib.rs:334-350 | robotctl/src/duck.rs:230-244 \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":"pad-imu/src/lib.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bed751a2fdf52fe088e292e12d2d41cb26a20ba4a960fbaa8ce8ca598da7a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): robotd/src/laser.rs:382-398 | robotd/src/soccer.rs:577-593 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/laser.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7334195ffcece2a4da23e2835a432f944ceee3e3bcc3d7c93949068360cec2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): robotd/src/main.rs:5073-5089 | robotd/src/main.rs:5103-5117 \u2014 both copies are in the same file, so extract the block 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":"robotd/src/main.rs"},"region":{"startLine":5073}}}],"partialFingerprints":{"codehealthFindingId/v1":"7779ec6a7907e050a2266d621ea57e7b3d2cb5f9743382cbda030d89ef9471f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): autod/src/brain.rs:977-992 | autod/src/brain.rs:1298-1311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060autod/src/brain.rs:977\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":"autod/src/brain.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"19434d27b77ba585a06c5b49e0d16b5ec4bbcee1a6514212e4676e59e1c621eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): duckctl/src/main.rs:2360-2370 | robotctl/src/main.rs:4888-4903 \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 \u0060robotctl/src/main.rs:4888\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/main.rs"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"037f3fac55851e7d8b0c030b6fc85e5c36d30052216aedf36e51e54c68aac4af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): netpadd/src/main.rs:306-321 | padd/src/main.rs:453-468 \u2014 before extracting anything, compare \u0060netpadd/src/main.rs\u0060 and \u0060padd/src/main.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 \u0060netpadd/src/main.rs:306\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":"netpadd/src/main.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"048c7ad40b7c60b096ce75a4222174e3d0bf19aa81d5754f0bcc6841618a9591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): robotctl/src/main.rs:948-963 | robotctl/src/main.rs:1331-1346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/main.rs:948\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"6966a88e29b983dd520ad7471b8cb432084e4fdddfcbb6fcfc9ff94e0332bc50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): robotd/src/main.rs:6391-6406 | updater/src/main.rs:702-717 \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 \u0060robotd/src/main.rs:6391\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":"robotd/src/main.rs"},"region":{"startLine":6391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6383dab79f8ddb4454f597f823698018f43bb1c33954f2f47bd860b8165e664b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): robotctl/src/imu_view.rs:201-215 | robotctl/src/vetbook.rs:110-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/imu_view.rs:201\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":"robotctl/src/imu_view.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0199b4b693ad6564ebfcf908aed08de8e087b294217e05971173426af0adfc0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): tof/src/main.rs:362-376 | tof/src/main.rs:516-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tof/src/main.rs:362\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":"tof/src/main.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac88fd5156573c5958d47369ad546d6c96bbdc70ce1386a280fb196ef4bcb91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): robotctl/src/main.rs:954-967 | robotctl/src/main.rs:1041-1054 | robotctl/src/main.rs:1185-1198 | robotctl/src/main.rs:1337-1350 \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 \u0060robotctl/src/main.rs:954\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, \u0060robotctl/src/main.rs:953\u0060 calls \u0060ask\u0060 and \u0060robotctl/src/main.rs:1040\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":"robotctl/src/main.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45899821a8d29ae449ff481567ca276b5381f5e2a771a595ccfb38bac89a759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): mapd/src/main.rs:276-286 | tof/src/main.rs:615-628 \u2014 before extracting anything, compare \u0060mapd/src/main.rs\u0060 and \u0060tof/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 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":"mapd/src/main.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9c749c2aceb6fe574039e1766a92e15d2c744446100d7605f648e1ad7c8d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): robotctl/src/main.rs:1081-1094 | robotctl/src/main.rs:1237-1250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/main.rs:1081\u0060 it begins part-way through the construct above it, so those exact 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, \u0060robotctl/src/main.rs:1096\u0060 calls \u0060filter\u0060 and \u0060robotctl/src/main.rs:1252\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":"robotctl/src/main.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7b50b149abec485c715490693fa42a3752780863718fd315e92ff70dffc484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): robotd/src/laser.rs:458-471 | robotd/src/soccer.rs:649-662 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:458\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":"robotd/src/laser.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb048d1223f96d504450f704c16661af586dfd31464ef0e19156b36c46cced2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): updater/src/ipc.rs:664-675 | updater/src/ipc.rs:690-701 | updater/src/ipc.rs:796-808 \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":"updater/src/ipc.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f88fe5298404fbb1e1cb9e0f6b8091b677b391f559664cd0b34b97b1bf4e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): robotctl/src/show.rs:360-372 | updater/src/engine.rs:2966-2978 \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":"robotctl/src/show.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0eeb69b0be5277298383cad948406b9ac450fc3706f97c035aeb8a9ba8c054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): robotd/src/laser.rs:441-453 | robotd/src/soccer.rs:632-644 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:441\u0060 it begins part-way through the construct above it, so those exact 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":"robotd/src/laser.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8695e29c5d5a684fbe56b52e9edafe204aac277328f4e9d1988c97bc175dded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): mediad/src/main.rs:717-730 | mediad/src/main.rs:744-755 | mediad/src/main.rs:767-778 \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 \u0060mediad/src/main.rs:717\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/main.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1be2f5841f4f69b56dbfb2408e17e92899b9bcd4840c8e8c417f7e5dd0f1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): btd/src/main.rs:218-229 | configd/src/main.rs:674-685 \u2014 before extracting anything, compare \u0060btd/src/main.rs\u0060 and \u0060configd/src/main.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060btd/src/main.rs:218\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":"btd/src/main.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"133299f05bc7b462041eea047bf4411592e5e62b8962faa2cf78f2e58b8b5761"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): configd/src/main.rs:114-123 | updater/src/ipc.rs:79-90 \u2014 before extracting anything, compare \u0060configd/src/main.rs\u0060 and \u0060updater/src/ipc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060configd/src/main.rs:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c094e57d0373970a3f7e04ee7901a776a03baf921ad068b77c53a6108fe6ca7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): configd/src/main.rs:449-460 | updater/src/ipc.rs:518-529 \u2014 before extracting anything, compare \u0060configd/src/main.rs\u0060 and \u0060updater/src/ipc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060configd/src/main.rs:449\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcb8300d962bd6e0ee24e3370ef9ba290d92ec75b1f4ae4f86d366b696e82de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): robotctl/src/main.rs:1021-1032 | robotctl/src/main.rs:1165-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc97d2324cce15b7dc90b54942939ba70a5a78dbb461d6b5361c1011005d1132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): robotctl/src/setup_code.rs:357-368 | robotctl/src/vetbook.rs:1226-1237 \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 \u0060robotctl/src/setup_code.rs:357\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":"robotctl/src/setup_code.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0358ee8f9050cc73dfbe5e84980778ee81f50cac0dae0a086d34e953b5f7c174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): robotd/src/main.rs:6444-6454 | robotd/src/posture.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":6444}}}],"partialFingerprints":{"codehealthFindingId/v1":"952299e4ba195c34ea508a4dfaf07cfc424310ca43bff5c520bc0b9e68f99147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): updater/src/ipc.rs:474-485 | updater/src/ipc.rs:1079-1089 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060updater/src/ipc.rs:474\u0060 it does not close everything it opens, so those exact 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, \u0060updater/src/ipc.rs:1090\u0060 calls \u0060send\u0060, \u0060clone\u0060 and \u0060updater/src/ipc.rs:486\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":"updater/src/ipc.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"580bd695402448260f4defa73bf4d25574c7213e55bb6e3bd3d441bd1b4c920c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): configd/src/bluez.rs:857-868 | configd/src/bluez.rs:933-944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060configd/src/bluez.rs:857\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":"configd/src/bluez.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6fa86f6465395cc49f45e8371614c609c8c097f818a96af45da5188d8aaf88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): configd/src/main.rs:406-416 | robotd/src/main.rs:5023-5033 \u2014 before extracting anything, compare \u0060configd/src/main.rs\u0060 and \u0060robotd/src/main.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060configd/src/main.rs:406\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4b19ceb770297d5d1756f829e78a0677f53869e74c7abf160f15e0f699627e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): netpadd/src/main.rs:74-84 | padd/src/main.rs:234-244 \u2014 before extracting anything, compare \u0060netpadd/src/main.rs\u0060 and \u0060padd/src/main.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 \u0060netpadd/src/main.rs:74\u0060 it does not close everything it opens, so those exact 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":"netpadd/src/main.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf92b17da183042d1b8b138773ae3ad657929d2c79d97f26f8ba06b620f3de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): robotd/src/sound.rs:431-441 | robotd/src/sound.rs:530-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotd/src/sound.rs:431\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/sound.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1914ded418f914382b234b4f9c5e00fcb51215c4c2b860e3f4d2e2b0e70d87d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): updater/src/verify.rs:237-247 | updater/src/verify.rs:284-294 \u2014 both copies are in the same file, so extract the block 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":"updater/src/verify.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3751a13ed8407b99b1e03cd481b79ffde7f9a661a830ddc6ba298b3f24482917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): configd/src/main.rs:446-455 | mapd/src/server.rs:73-82 | tof/src/main.rs:708-717 \u2014 before extracting anything, compare \u0060mapd/src/server.rs\u0060 and \u0060tof/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"configd/src/main.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"768a934e9bb560fe07c335c6bde2d339ddad101491c986fbb0241adcb4404e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): autod/src/main.rs:1182-1190 | padd/src/main.rs:646-655 \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":"autod/src/main.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a9cbe01cdb7fa1a8fa57ce4f7c10d538f6850a22bf20b7c3492298b6c241b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): btd/src/chorale.rs:263-272 | duck-ether/src/main.rs:299-307 \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 \u0060btd/src/chorale.rs:263\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"btd/src/chorale.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1f01f18c370b1acf6f611220785d9ae883ed3bff2e14cdcb0af01f1b71cba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): configd/src/main.rs:439-448 | robotd/src/main.rs:5153-5162 \u2014 before extracting anything, compare \u0060configd/src/main.rs\u0060 and \u0060robotd/src/main.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060configd/src/main.rs:439\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69f2d635e0842f400dac8587b2e619e9194a34ce7eec33920ab7eb37dce7cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): configd/src/nm.rs:265-274 | configd/src/nm.rs:299-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060configd/src/nm.rs:265\u0060 it does not close everything it opens, so those exact 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":"configd/src/nm.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a5cd8006e3354f0b0830e2cbad841cb7f85a667a92ec900de534d1e12e8050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): configd/src/wifi_ssh.rs:284-292 | nfc/src/main.rs:878-887 \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 \u0060configd/src/wifi_ssh.rs:284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/wifi_ssh.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26684c40c4f9a1a79b86cde5954e6405f841eb968e5c6d06bbee06c75a7493b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): mediad/src/ball.rs:283-291 | mediad/src/laser.rs:311-320 \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 \u0060mediad/src/ball.rs:283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/ball.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fbef17ec7f287728ce7a08e3a5eb4f0e05f810c4757e2805a661051eeb2ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): nfc/src/main.rs:572-579 | padd/src/tap.rs:167-176 \u2014 before extracting anything, compare \u0060nfc/src/main.rs\u0060 and \u0060padd/src/tap.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nfc/src/main.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de310dc9cf971d50c99a8f0e93d77f40e36d7a5d2da53997364316254be6d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): robotctl/src/main.rs:872-881 | robotctl/src/vetbook.rs:165-174 \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 \u0060robotctl/src/main.rs:872\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"584e23d77236c4a3c31e60ec7c6ef9932fcd11c684c8456e592262c36be052fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): robotctl/src/main.rs:906-914 | robotctl/src/main.rs:1292-1301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/main.rs:906\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d44d1eba6508f8cf4e228f33e91e8b6805f43d025d80ac1204cb2d0630af526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): robotctl/src/path_map.rs:283-292 | robotctl/src/path_map.rs:352-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/path_map.rs:283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/path_map.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"418ff0821016fc7a9df964a09202d2954a6b3cfca10bf9f30f24a26c6ae29b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): robotd/src/laser.rs:346-355 | robotd/src/soccer.rs:547-556 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/laser.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2377c63e6b81d6c94f39ff61a5622f187b8e5cb51fd3635093262d06bda877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): robotd/src/laser.rs:400-409 | robotd/src/soccer.rs:595-604 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:400\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/laser.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b2c5c97c89e0b1938b1384eac54a0dab5199da69dcc87377995b46d6d4d55b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): btd/src/main.rs:216-224 | configd/src/main.rs:672-680 | robotd/src/main.rs:6390-6397 | updater/src/main.rs:701-708 \u2014 before extracting anything, compare \u0060btd/src/main.rs\u0060 and \u0060configd/src/main.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"btd/src/main.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"889f4d88949906d677a5807e3cc29922be6934d4a26b1cea354b84857c093d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): btd/src/main.rs:93-101 | configd/src/main.rs:227-235 \u2014 before extracting anything, compare \u0060btd/src/main.rs\u0060 and \u0060configd/src/main.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"btd/src/main.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bfb0f6dd9fe1ed788427ed280b0934a378d47952f026317363e418f2844421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): btd/src/upstream.rs:228-236 | mediad/src/upstream.rs:185-193 \u2014 before extracting anything, compare \u0060btd/src/upstream.rs\u0060 and \u0060mediad/src/upstream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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 \u0060btd/src/upstream.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"btd/src/upstream.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1323aa79f0a0a3d1e699da7088a668125ee763dbecda461d5386ff7faa551159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): configd/src/main.rs:428-436 | updater/src/ipc.rs:497-505 \u2014 before extracting anything, compare \u0060configd/src/main.rs\u0060 and \u0060updater/src/ipc.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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 \u0060configd/src/main.rs:428\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8095e58395613d88c506d605587a5a57f4957652f628a398e1403b3ff74267c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): duck-ipc-proto/src/lib.rs:1837-1846 | updater/src/ipc.rs:872-880 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-ipc-proto/src/lib.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"064a423ae884e13cb21531d61baba04d511c63c07166e8c47d3a3f28e632296d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): mediad/src/frame.rs:49-54 | robotd/src/main.rs:4874-4882 \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":"mediad/src/frame.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0c6aa69bb663779bbb2367611e530d327a090cc5a213e0feacd3ec2a702bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): robotd/src/laser.rs:198-206 | robotd/src/soccer.rs:355-362 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:198\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":"robotd/src/laser.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ecda589ac311f68b5fbc14cf13accfd4bd2909ba8ce49fb3be458caf3cbbd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tof/src/main.rs:772-780 | tof/src/main.rs:797-805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tof/src/main.rs:772\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":"tof/src/main.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5584792c86dca08d7bff88adc3b43c7f6de14540d4bb2d43343e151921b7992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): autod/src/main.rs:109-116 | mediad/src/main.rs:199-206 | nfc/src/main.rs:117-124 | updater/src/main.rs:214-223 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/main.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0e8acbdab01cacb5d6fe44c636cd7be0c3fda3faca2749ceca09c71ef268e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): configd/src/main.rs:496-503 | robotd/src/main.rs:6357-6364 \u2014 before extracting anything, compare \u0060configd/src/main.rs\u0060 and \u0060robotd/src/main.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d84a8ac0c3d94022aec321fd431fd5abe56778c4c5ff089f100621d94c8a2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): maploc/src/sim.rs:258-265 | maploc/src/sim.rs:286-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060maploc/src/sim.rs:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060maploc/src/sim.rs:257\u0060 calls \u0060compose\u0060 and \u0060maploc/src/sim.rs:285\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":"maploc/src/sim.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"55663e84483f17ba58d9683f41da72b8e6586c2ecb084f0b2799ea592690fb90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): netpadd/src/robotd.rs:68-75 | padd/src/main.rs:658-665 \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 \u0060netpadd/src/robotd.rs:68\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":"netpadd/src/robotd.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa2cf80eb347812fbd30cef8aa47a93407f545e0459496ac210ab7bc74a2407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): robotd/src/head_imu.rs:476-483 | tof/src/imu.rs:268-275 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060shutdown\u0060 to \u0060\u0026AtomicBool\u0060 in one and \u0060\u0026Arc\u003CAtomicBool\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":"robotd/src/head_imu.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de2eb3ffdc69bb1134bbdf6c089580bfe14d36b378af2b1f2b2d93c92fbcdb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): robotctl/src/main.rs:776-782 | robotctl/src/main.rs:872-879 | robotctl/src/vetbook.rs:165-172 \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 \u0060robotctl/src/main.rs:872\u0060 it begins part-way through the construct above it, so those exact 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":"robotctl/src/main.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0298c91e4b0352e7f4b211cb0e9087767364b99ad06691076baadc0ab32f511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): robotd-params/src/lib.rs:1411-1417 | robotd-params/src/lib.rs:1602-1608 \u2014 both copies are in the same file, so extract the block 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":"robotd-params/src/lib.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d3a20d1b1b8caaa716b16ea4358c3f208188be446f3b227bb64a6c6034d531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): robotd/src/laser.rs:322-328 | robotd/src/soccer.rs:524-530 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:322\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/laser.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cfcaf5e78d947b34b4e4eb6cc8156578b66a40027d4d8acec82db70bde0bc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): robotd/src/soc.rs:108-119 | robotd/src/soc.rs:157-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotd/src/soc.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/soc.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac30b2682599feb1bf93c023adbf3cec91e6cb23a0f69a703f70a01487e420c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sounds/src/voices.rs:143-149 | sounds/src/voices.rs:310-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sounds/src/voices.rs:143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sounds/src/voices.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"debf4b16cc6faeb9d2bd8402689f21f3918fca68b8ed091a107fac027f90c826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): sounds/src/voices.rs:309-314 | sounds/src/voices.rs:374-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sounds/src/voices.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"327de242e33dfdd907b240868d62a082db9006ba1ed10852c27b0696b8629d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): updater/src/engine.rs:1172-1178 | updater/src/engine.rs:1734-1740 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060updater/src/engine.rs:1172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/engine.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4cf042f7c821d0e1c9425c1881158fcb42c6b902ca1d2f89bbeec62f178db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): updater/src/journal.rs:222-230 | updater/src/journal.rs:483-491 \u2014 both copies are in the same file, so extract the block 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":"updater/src/journal.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7ddc253c72a2f776a5521d0e295be10e7ad3f2e0499f3b59b5d5f68a59f798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): updater/src/journal.rs:248-256 | updater/src/journal.rs:497-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060updater/src/journal.rs:248\u0060 it begins part-way through the construct above it, so those exact 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, \u0060updater/src/journal.rs:493\u0060 calls \u0060write_all\u0060 and \u0060updater/src/journal.rs:246\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":"updater/src/journal.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74f6bb2edb35b1ff4f1c0743905e88953e9cca6628af14cea5ac1246e7496f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): mediad/src/pipeline.rs:500-505 | mediad/src/pipeline.rs:656-661 | mediad/src/pipeline.rs:1421-1426 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mediad/src/pipeline.rs:663\u0060 calls \u0060default\u0060 and \u0060mediad/src/pipeline.rs:1428\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":"mediad/src/pipeline.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b96a51911d682ab141d22ee696f4ced3177446f8d690c3573e6481d871e0481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): autod/src/brain.rs:1405-1410 | autod/src/brain.rs:1425-1431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060autod/src/brain.rs:1405\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":"autod/src/brain.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fde854b10b382a1de4941dd5d334d9c14cafabcd799fdfbc4dd378f6f9cfcb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): btd/src/upstream.rs:213-219 | mediad/src/upstream.rs:171-177 \u2014 before extracting anything, compare \u0060btd/src/upstream.rs\u0060 and \u0060mediad/src/upstream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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":"btd/src/upstream.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9585407de8e3aaabf1b13c83fe5d166eba1ed8854b801836a37fbac7b10c9ab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): maploc/src/mapper.rs:1304-1309 | maploc/src/mapper.rs:1791-1796 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060maploc/src/mapper.rs:1304\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/mapper.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0407096e2064db2280a20a013b75277205f2559e5015e520ca5dcaad6f41ec1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): netpadd/src/main.rs:379-384 | padd/src/main.rs:580-585 \u2014 before extracting anything, compare \u0060netpadd/src/main.rs\u0060 and \u0060padd/src/main.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 \u0060netpadd/src/main.rs:379\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":"netpadd/src/main.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b281fe91bd4d8832d4d6bc5e1354090231e7dc97889b363b5be0a84e81ea9cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): robotd/src/sound.rs:79-84 | robotd/src/sound.rs:830-835 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/sound.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d545ee7a9b054e1370c3d3642b264ba611d1e6dadde5c700f9b6f5da905e0748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): mapd/src/main.rs:321-325 | mediad/src/frame.rs:375-379 | nfc/src/main.rs:749-753 | padd/src/tap.rs:964-968 | tof/src/main.rs:836-840 \u2014 before extracting anything, compare \u0060mapd/src/main.rs\u0060 and \u0060tof/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 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 \u0060mapd/src/main.rs:321\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":"mapd/src/main.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"080b1bb901e31ad2610d2fc8f812e8b6ad3d075c2f38bebc8457c81a949e9f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): configd/src/main.rs:663-668 | robotd/src/main.rs:6381-6386 | updater/src/ipc.rs:1241-1246 \u2014 before extracting anything, compare \u0060configd/src/main.rs\u0060 and \u0060robotd/src/main.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"configd/src/main.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b2303a85efd9990fde4661db176c7af9338f86abdf7c8c721cdb906509ac99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): robotctl/src/main.rs:1027-1032 | robotctl/src/main.rs:1171-1176 | robotctl/src/main.rs:1323-1328 \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":"robotctl/src/main.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"626db9010ee237222fb88c6455e506d43ad800a2cecbe3589e668b77d0bf2b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): sounds/src/voices.rs:78-82 | sounds/src/voices.rs:141-146 | sounds/src/voices.rs:159-163 \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 \u0060sounds/src/voices.rs:141\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sounds/src/voices.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"af01b008e3d2baf6463014218028447555548ebfbcd7a045490d96598217e6cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): robotctl/src/path_map.rs:125-130 | robotctl/src/path_map.rs:194-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/path_map.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5909fdb8530decb04d5633a1abce01d66a7fef637be8329f3d26f9c23cfdf1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): autod/src/brain.rs:329-336 | robotd/src/idle_head.rs:320-327 \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":"autod/src/brain.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff34d22e10208716cf7e8793efd695af0cc19892e463ea4e8127e5bca9374a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): autod/src/main.rs:555-559 | robotd/src/vetbook.rs:50-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/main.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f30ae67872265e60659751f32541cc72b14380bd9c8b6e147c90f7ab2dfadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): btd/src/main.rs:65-73 | configd/src/main.rs:186-192 \u2014 before extracting anything, compare \u0060btd/src/main.rs\u0060 and \u0060configd/src/main.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"btd/src/main.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f52589486219b6a264bb5f930358c0ffa1e61c0186f13ea96d8c8101dcb12db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): btd/src/upstream.rs:258-266 | mediad/src/upstream.rs:215-223 \u2014 before extracting anything, compare \u0060btd/src/upstream.rs\u0060 and \u0060mediad/src/upstream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 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":"btd/src/upstream.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa95cc7db60ad3bda0b59376ca6124110d2760bf9aa2bd7c0e0fa1a2d6382d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mapd/src/server.rs:140-144 | tof/src/main.rs:845-849 \u2014 before extracting anything, compare \u0060mapd/src/server.rs\u0060 and \u0060tof/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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 \u0060mapd/src/server.rs:140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mapd/src/server.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9434fd897a12227422b9165718ac6491a0d848e5b0265d8364fa000c93db450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): robotctl/src/main.rs:2992-2997 | updater/src/journal.rs:19-24 \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":"robotctl/src/main.rs"},"region":{"startLine":2992}}}],"partialFingerprints":{"codehealthFindingId/v1":"666f29214bf6da1d62f8dcd31af52f704361a4d06269016c2ee0716b7e2dd109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mediad/src/ball.rs:251-258 | mediad/src/laser.rs:280-287 \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":"mediad/src/ball.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a655cc585fef3dfb2ad3cd229bce2f46b5e5015a73a82937e32c956662bb0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201326 lines \u00D7 2): robotctl/src/main.rs:916-941 | robotctl/src/main.rs:1303-1323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/main.rs:916\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bbcf9f026d5e71adbc3ee33da9f8066f535d3ab65b33961ae3cbba41759d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): robotctl/src/main.rs:3391-3401 | robotctl/src/main.rs:3412-3427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/main.rs:3391\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":"robotctl/src/main.rs"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e813d7c96347c49a2a007d42d3932b01bc53ed4012997247f4c9b1231edf4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): robotd/src/main.rs:2965-2979 | robotd/src/main.rs:3909-3923 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotd/src/main.rs:2965\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":"robotd/src/main.rs"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa97e398a9ef57449c43eea99b1b28bb85707d3dab090cc8433bffaaa8c3653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): robotd/src/sound.rs:377-390 | robotd/src/sound.rs:497-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotd/src/sound.rs:377\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/sound.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70668d9ad045349b70399269d8eeb35a0a376b5fcaeadc35ccc60af979c0979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): robotctl/src/main.rs:3400-3415 | robotctl/src/main.rs:3426-3441 \u2014 both copies are in the same file, so extract the block 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":"robotctl/src/main.rs"},"region":{"startLine":3400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b54b3914d818de70fa52d95530ae507509fde1d83667b7d69edeb7ceace3ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): duck-control/src/bus.rs:826-833 | duck-control/src/bus.rs:845-854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060duck-control/src/bus.rs:826\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-control/src/bus.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"2224fb9140a47a4e59322d614c104d00468a12023b646bcca220ce76bb8534a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): robotctl/src/main.rs:2735-2742 | robotctl/src/main.rs:3474-3483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/main.rs:2735\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"99edadb0662f8c1ec00bdaf66677d9537b1ce04f6406f3f18bf069e08a69ef4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): robotd/src/main.rs:5083-5091 | robotd/src/main.rs:5135-5143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotd/src/main.rs:5083\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":"robotd/src/main.rs"},"region":{"startLine":5083}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f102a7f590dff5908a15ab6cabae8725f77e50bd9ab5c7e984e0e2e6a93aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): robotctl/src/main.rs:2868-2875 | robotctl/src/main.rs:2893-2900 \u2014 both copies are in the same file, so extract the block 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":"robotctl/src/main.rs"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d9355ce0e9a98564d14303b31878fe80ab2e332054cfa011e4406817513b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): robotctl/src/monitor.rs:560-567 | robotctl/src/monitor.rs:607-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060robotctl/src/monitor.rs:560\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/monitor.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4a02655c24e7d4ddcb2a4a82842e594805ea0c242cb864f0a009f67a3eec2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): btd/src/session.rs:196-202 | btd/src/session.rs:252-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060btd/src/session.rs:196\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":"btd/src/session.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"782a3a78ed0dad7176a4f61e58a4a1f199fda0cbe1bda380e751a0b3aa907724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): updater/src/ipc.rs:610-616 | updater/src/ipc.rs:848-854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060updater/src/ipc.rs:610\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":"updater/src/ipc.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6c53adefae99c77b29e27bed0ee4f872bce0f74d6a216788932c06973fae74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mediad/src/pipeline.rs:644-650 | mediad/src/pipeline.rs:801-807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/pipeline.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"421d61c7020ea9c44e02c021c82d1747f0f8f81d8db5a89c714a95f61d1ad612"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): robotd/src/laser.rs:113-119 | robotd/src/soccer.rs:170-176 \u2014 before extracting anything, compare \u0060robotd/src/laser.rs\u0060 and \u0060robotd/src/soccer.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 111 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 \u0060robotd/src/laser.rs:113\u0060 it does not close everything it opens, so those exact 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 \u0060params\u0060 to \u0060LaserParams\u0060 in one and \u0060SoccerParams\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":"robotd/src/laser.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ffdb53a54dc40dc202bc9da8097f0be359e7d50b17a2586c741a232f728891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): duck-auth/src/tcp.rs:49-54 | duck-auth/src/tcp.rs:70-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-auth/src/tcp.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81a196e218eeb572d2adc11cc5b9200c187b9c6ab8ca6d6ee86c427a6e02d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mapd/src/worker.rs:332-336 | mapd/src/worker.rs:354-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mapd/src/worker.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4877de6358372a5858a782e9b98e1fa9e4e81a260fdbb4666cd174502eae927e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): maploc/src/field.rs:71-76 | maploc/src/grid.rs:41-46 \u2014 before extracting anything, compare \u0060maploc/src/field.rs\u0060 and \u0060maploc/src/grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060maploc/src/field.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/field.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6384eb2cd068b9b87933e0eb66a5137024ec4103fdab8d4bf34705f60f6dc115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): maploc/src/field.rs:92-97 | maploc/src/grid.rs:56-61 \u2014 before extracting anything, compare \u0060maploc/src/field.rs\u0060 and \u0060maploc/src/grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/field.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e4b108d652b77ff23441c328b8f599715bf462db2b4507d18e79b1b4fddda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): maploc/src/matcher.rs:488-492 | maploc/src/matcher.rs:493-497 | maploc/src/matcher.rs:498-502 \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":"maploc/src/matcher.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f615b1fe7e1bcd40819cc056290b882ca4b41478169bb0adfc52da810335b8ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): pad-imu/src/lib.rs:385-390 | robotctl/src/duck.rs:266-271 \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":"pad-imu/src/lib.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d6123565895cb31290db7c6bca873f4cdd5f085fddd2233e8f8e09e10be815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): robotctl/src/main.rs:2977-2982 | robotctl/src/show.rs:393-398 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060entry\u0060 to \u0060\u0026proto::LogEntry\u0060 in one and \u0060\u0026duck_ipc_proto::LogEntry\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":"robotctl/src/main.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4c043295a2a9d7c47086daafadc3f9d068b3c98eda3af2c46aa05cd66bb76c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): spaces/shared/rendezvous.py:158-216 | spaces/vision-demo/rendezvous.py:158-216 \u2014 \u0060spaces/shared/rendezvous.py\u0060 and \u0060spaces/vision-demo/rendezvous.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 110 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":"spaces/shared/rendezvous.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fb29c2697b7f563ce15a792d1aee902576d3f574bb7b8637145728a0d13a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): spaces/shared/wire.py:106-149 | spaces/vision-demo/wire.py:106-149 \u2014 \u0060spaces/shared/wire.py\u0060 and \u0060spaces/vision-demo/wire.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 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":"spaces/shared/wire.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2917accebec419e3f89ea48ae66e39488a78bae9be99c9baf1be83bd2fe042c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): spaces/shared/wire.py:260-298 | spaces/vision-demo/wire.py:260-298 \u2014 \u0060spaces/shared/wire.py\u0060 and \u0060spaces/vision-demo/wire.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The 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":"spaces/shared/wire.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda14d973bd8c331632f7050fcd995a517af5883535bd22e737810faf868fbc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): spaces/shared/control.py:117-154 | spaces/vision-demo/control.py:117-154 \u2014 \u0060spaces/shared/control.py\u0060 and \u0060spaces/vision-demo/control.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 89 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The 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":"spaces/shared/control.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9a282fdf5150d2c7d5b635f281da16ae24b0fcb742e54ef0a832f71374247a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): spaces/shared/wire.py:220-257 | spaces/vision-demo/wire.py:220-257 \u2014 \u0060spaces/shared/wire.py\u0060 and \u0060spaces/vision-demo/wire.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The 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":"spaces/shared/wire.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6277eb3197f4723bba1881164c35c307c074d66146bd5ce8f86525e1c92ed0a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): spaces/shared/wire.py:301-334 | spaces/vision-demo/wire.py:301-334 \u2014 \u0060spaces/shared/wire.py\u0060 and \u0060spaces/vision-demo/wire.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The 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":"spaces/shared/wire.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cef4ae1cdc1d05a3141688930b6cfb9fb6867ec7c7c4d513b3bb72eef0ca258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): spaces/shared/control.py:83-114 | spaces/vision-demo/control.py:83-114 \u2014 \u0060spaces/shared/control.py\u0060 and \u0060spaces/vision-demo/control.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 89 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The 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":"spaces/shared/control.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe816174f5ac20af325058ad545aa66c60ea370e4595ee6ed0e0effdb820d46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): spaces/shared/wire.py:76-101 | spaces/vision-demo/wire.py:76-101 \u2014 \u0060spaces/shared/wire.py\u0060 and \u0060spaces/vision-demo/wire.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 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":"spaces/shared/wire.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eea9e6b4bf4f56bf917d478f5184e10e705b18890196dfca14a81f2ba3fe6bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): spaces/shared/rendezvous.py:117-137 | spaces/vision-demo/rendezvous.py:117-137 \u2014 \u0060spaces/shared/rendezvous.py\u0060 and \u0060spaces/vision-demo/rendezvous.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 110 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":"spaces/shared/rendezvous.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8c9a02d76f78de3ac61088f7263399590d03228cf93fcd061550aca6c7e54d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): spaces/shared/wire.py:199-217 | spaces/vision-demo/wire.py:199-217 \u2014 \u0060spaces/shared/wire.py\u0060 and \u0060spaces/vision-demo/wire.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 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":"spaces/shared/wire.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6ced6c4d544b5be13571d3db37256a8562ac2d41c1a75f0383ed9b215c06b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): spaces/shared/rendezvous.py:99-114 | spaces/vision-demo/rendezvous.py:99-114 \u2014 \u0060spaces/shared/rendezvous.py\u0060 and \u0060spaces/vision-demo/rendezvous.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 110 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":"spaces/shared/rendezvous.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4813582a0a8f39db9432860a28ea79cd7de8ae01e46000ce759d62945a40cddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): spaces/shared/wire.py:153-166 | spaces/vision-demo/wire.py:153-166 \u2014 \u0060spaces/shared/wire.py\u0060 and \u0060spaces/vision-demo/wire.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 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":"spaces/shared/wire.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02b5775d1ec5903d64f459e409d1681b22b56fa4277ea637e317232f64aa1a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): spaces/shared/rendezvous.py:141-154 | spaces/vision-demo/rendezvous.py:141-154 \u2014 \u0060spaces/shared/rendezvous.py\u0060 and \u0060spaces/vision-demo/rendezvous.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 110 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":"spaces/shared/rendezvous.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aee76baf39eb9c31008eb37784376a784f4fa56c59d10a5fb1a09731ccebc34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): spaces/shared/control.py:62-72 | spaces/vision-demo/control.py:62-72 \u2014 \u0060spaces/shared/control.py\u0060 and \u0060spaces/vision-demo/control.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 89 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":"spaces/shared/control.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1531e95baecd369d0eb13333ab3b3f28a15842f12cc64d67d68d20d9db1ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): spaces/shared/control.py:157-164 | spaces/vision-demo/control.py:157-164 \u2014 \u0060spaces/shared/control.py\u0060 and \u0060spaces/vision-demo/control.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 89 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":"spaces/shared/control.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1d16424c49fc895f01240cd5193f59b59187e6dfdabf922f21a8b8da656a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): spaces/shared/wire.py:186-194 | spaces/vision-demo/wire.py:186-194 \u2014 \u0060spaces/shared/wire.py\u0060 and \u0060spaces/vision-demo/wire.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 8 separate duplicated blocks between them, totalling at least 223 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The 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":"spaces/shared/wire.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"abca09817e062b3f0b621330a57a592888af5c1651a8379511888224b9930fcb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: duck-auth: duck-auth: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d4ecb876eecce2b786260a6aaa2942edc882ba5539ce5bfdf2c7605d3681986"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: duck-ble: duck-ble: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6efa8bad29c83180aecf4c8563c7b2c837406c9cb4eb223d7bb13ce5d391d8ec"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: duck-ipc-proto: duck-ipc-proto: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 20 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d973ef527765b0d931a332f56ba11338da6f86e14f2b66d3907b8d0254862372"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: kinematics: kinematics: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"84a2abe7dc86d5568befa7a900b88e0c917d1af8614993f6987418218c695c2f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pet-detect: pet-detect: 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":"06279e28ffa302de61fb8a14cb8ff8627fe59255402f8452d732586e75b46915"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: uyvy: uyvy: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"631cada4bfebb67e8d5f77f8fa58fb798ad3b6c595927d590c76b0c7c4af6c83"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: robotd-params: robotd-params: abstractness 0.00, instability 0.11, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"244e77d4c1045bd235a272d01c98f8a8af40a4488cba3485f893392eb51a5405"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pad-imu: pad-imu: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"96415d9f905bf3f04ec0cbfe19217636f589a402fbe08461c47daea632d96170"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Intents (LCOM4 9): Intents\u0027s methods fall into 9 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 9 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":"robotd/src/intents.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92694d5a378b4f7799b960354fe436100a680a52434ef12900b2f67a60d573e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FakeIo (LCOM4 6): FakeIo\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":"duck-control/src/io.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"522c710d60540ce7cdde1c4c099e57b9a9af1bc3edbfc315a02304201a285dd8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Notices (LCOM4 4): Notices\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":"duckctl/src/udp_pad.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b454bb1b1cc1139fddfcd0899793e7f641a7efb873cdb28255c3933469c856d2"}},{"ruleId":"D12","level":"warning","message":{"text":"Yanked release: btleplug: \u0060btleplug\u0060 resolves to 0.13.0 in the committed Cargo.lock, and crates.io reports that release as YANKED. A yanked release is one the publisher has withdrawn and asked you to stop using; it keeps resolving only so existing locks do not break. The current stable release is 0.13.5. Run \u0060cargo update -p btleplug\u0060 and commit the updated lock."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"db4a33f87d1d745a898217227696e1f50c1aef43b38e2f2814739e10567970b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotd/src/main.rs: robotd/src/main.rs changed 139 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 294 in robotd::control_loop at line 2403. 2 of those changes were fix/bug commits, and the other 137 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotd/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotd/src/main.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f846dafd6999f6e8a33ff1a6b3bd590c4e846d41620203f02ebf680aedf9fe42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: duckctl/src/main.rs: duckctl/src/main.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in duckctl::run at line 1703. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- duckctl/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duckctl/src/main.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa7f756cc71132efee4015227f24eb8ec6b11b6843ec7a1ba82a5462062fb5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotctl/src/main.rs: robotctl/src/main.rs changed 111 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in robotctl::run at line 5828. 2 of those changes were fix/bug commits, and the other 109 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotctl/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":5828}}}],"partialFingerprints":{"codehealthFindingId/v1":"608b77a23bddbb0d35387dffdbd1e8ad3e3c8b39c482def3f41f4d0de543125f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotd-params/src/lib.rs: robotd-params/src/lib.rs changed 100 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Params::validate at line 3463. 2 of those changes were fix/bug commits, and the other 98 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotd-params/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":"robotd-params/src/lib.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4124876dd26b13ac0919ac2ab7f22118f4cb32fb6636be4afbf00badc818bc26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotctl/src/configure.rs: robotctl/src/configure.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in robotctl::configure::run at line 464. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotctl/src/configure.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":"robotctl/src/configure.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e8fe17b98ba840db69ce371d29465bf19d60868fc7609c99008a6096774759"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: updater/src/ipc.rs: updater/src/ipc.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Server::dispatch at line 551. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- updater/src/ipc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/ipc.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"4550fc0f655641eb4444a2a107aa0a67803eb9a8458293089b28ee24b6835e00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: padd/src/main.rs: padd/src/main.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in padd::main at line 233. 2 of those changes were fix/bug commits, and the other 56 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- padd/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"padd/src/main.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"130978f7fff62d405f31f2f327b2e99971cf7408b0dba3fbf70e98d10ec4e139"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mediad/src/main.rs: mediad/src/main.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in mediad::main at line 198. 1 of those changes was a fix/bug commit, and the other 50 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- mediad/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/main.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2195f8005972fdab9ed6fe87f2aefb2185b92188594001566c6618612b2c5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotctl/src/monitor.rs: robotctl/src/monitor.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in robotctl::monitor::live at line 973. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotctl/src/monitor.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":"robotctl/src/monitor.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec9d561b459746d24b93e6885472afab0949008b23620fc8273b1f1a808967a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mediad/webclient/index.html: mediad/webclient/index.html changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in index.html.onSignalling at line 1006. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- mediad/webclient/index.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9433cd45b6745a9bd2adbb27e548de09799af0a108fe4ccd4c74b402c12d20a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: autod/src/brain.rs: autod/src/brain.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 152 in Brain::step at line 732. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- autod/src/brain.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":"autod/src/brain.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ec390b652c40912813ff14f43083bbf9f2db83ad27389ef4320b6f90d50b76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotd/src/control.rs: robotd/src/control.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Controller::step at line 533. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotd/src/control.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":"robotd/src/control.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f4679350a0e1de40632343862ebc01ffcdc62df1563337c1bca8129f7803bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: netpadd/src/main.rs: netpadd/src/main.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in netpadd::serve at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- netpadd/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"netpadd/src/main.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7881075c6881700685899da3c837441cb28bd41b8cf9014fb5c0b0d09556d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: duckctl/src/udp_pad.rs: duckctl/src/udp_pad.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in duckctl::udp_pad::run at line 345. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- duckctl/src/udp_pad.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":"duckctl/src/udp_pad.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439212681aaad088d6e88c88a9f7567e9e9b772b8f40efce8e9f138197664c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: updater/src/engine.rs: updater/src/engine.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Engine::apply_inner at line 713. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- updater/src/engine.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":"updater/src/engine.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3cd54309e44c79ce92fc6f6e4148faf87188c5ace6ddbcadacf11ac9d3b220"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pad-map/src/mapper.rs: pad-map/src/mapper.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Mapper::tick at line 258. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- pad-map/src/mapper.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":"pad-map/src/mapper.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d7aa97264475eacb18c82219a27d0cb4fb1f160c834ddd74a07db6059f40f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/src/main.rs: xtask/src/main.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in xtask::package at line 281. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- xtask/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff25c237cc89f8deb8f42b76ea49283325d779974670e147cb5786c2447a564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: autod/src/main.rs: autod/src/main.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in autod::drive at line 738. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- autod/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"autod/src/main.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d81740edfc33c3f681f7354e08f397c5f15beeed3e96936c6f706366e57f7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotctl/src/vetbook.rs: robotctl/src/vetbook.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in robotctl::vetbook::live at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotctl/src/vetbook.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":"robotctl/src/vetbook.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1ff187ffa604f57e0c0c9a476fbeadec448b4cc19422c5531a259dc3f9db4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: nfc/src/main.rs: nfc/src/main.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in nfc::watch at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- nfc/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nfc/src/main.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"504b97118851cb73172df10e19b56099fb55d7a19c1c7b40dd75cd8dae71d33d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: duck-control/src/bus.rs: duck-control/src/bus.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DynamixelIo::check_registers_of at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- duck-control/src/bus.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":"duck-control/src/bus.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4583308bf08bfbc21236faee073c22ae6a40f1edd0a00fda975d57398fef1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: configd/src/bluez.rs: configd/src/bluez.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in BlueZ::bond at line 830. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- configd/src/bluez.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":"configd/src/bluez.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1ea79e65c075527894cc3919c1cce83cfbecb36e71ec69381d4d9018e83e8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mediad/src/relay.rs: mediad/src/relay.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Relay::session at line 660. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- mediad/src/relay.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":"mediad/src/relay.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"390cdc39eceb209d62e82be73d360d62902b88917aaf562769a329ac1bfaf38f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: maploc/src/mapper.rs: maploc/src/mapper.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Mapper::search_once at line 1576. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- maploc/src/mapper.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":"maploc/src/mapper.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6663de9d33e56355f529a15ec0d283e6a8ec818017acdf1c4571f8a09cd09086"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: configd/src/main.rs: configd/src/main.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in configd::dispatch at line 471. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- configd/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"configd/src/main.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56214710d1a9f94956cd55384afddfbdd2bd9c5f0d9e45bb96e4ba163d8bb33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: updater/src/policy.rs: updater/src/policy.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in updater::policy::fetch at line 1321. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- updater/src/policy.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":"updater/src/policy.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bceb20e3972f62a619577d94452080f180c467c1fd59384700181540879b884"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: spaces/policy-playground/web/src/main.ts: spaces/policy-playground/web/src/main.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in main.card at line 466. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- spaces/policy-playground/web/src/main.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":"spaces/policy-playground/web/src/main.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bbe61827fb552902d0edc5980352c4441c1c2ac99fd34ea706c728205bd024"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotd/src/vetbook.rs: robotd/src/vetbook.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Tracker::tick at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotd/src/vetbook.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":"robotd/src/vetbook.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dbbc8f4929d92b096536f1377cf86fa9b23fee8165caa3d640a6610decb31c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotd/src/sound.rs: robotd/src/sound.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Sound::sing_start at line 488. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotd/src/sound.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":"robotd/src/sound.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a60302d22c72831ef7f4eeeb37b2f432df1081997dbb118a0150eb9f489196"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: spaces/vetbook/cards.py: spaces/vetbook/cards.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in cards.card_for at line 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- spaces/vetbook/cards.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/vetbook/cards.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1344e5056781ca1297f7ddac8fc0373d5c54b743441621282a5190078dbbabaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: btd/src/secure.rs: btd/src/secure.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in btd::secure::run at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- btd/src/secure.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":"btd/src/secure.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae55e6d108823717f68a64dd76907c4585a95ac558a4111782c66f939cff26b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: updater/src/config.rs: updater/src/config.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Config::validate 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- updater/src/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":"updater/src/config.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcfd75d52afd1e20d1292a3a240addcc623789fccd27d9ef1423c7932f18ccb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sounds/src/main.rs: sounds/src/main.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in sounds::main at line 281. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- sounds/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sounds/src/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adbe03bd09cdea42cd3b4baf6a370b0e19b7e0f55d4af54cf247224dafda3d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: updater/src/source/http.rs: updater/src/source/http.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in updater::source::http::attempt_download at line 220. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- updater/src/source/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":"updater/src/source/http.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ba8c286fd416747ca21487b7475b66eda422ee4502df0e9a506557ed011162"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: robotd/src/soccer.rs: robotd/src/soccer.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Soccer::plan at line 406. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- robotd/src/soccer.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":"robotd/src/soccer.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"70030f877949333c01863acc9aba963763af2f840133f36f66433b17c8dea2d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: maploc/src/sim.rs: maploc/src/sim.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Robot::run at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 18:41:15 \u002B08:00\u0027 --until=\u00272026-11-13 18:41:15 \u002B08:00\u0027 --full-history --no-merges -- maploc/src/sim.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"maploc/src/sim.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ae4c788f477d633bccae3b311f6f155169aac6cef158410da8e3599964b6d6"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 42 significant file(s) lose their only recent owner: autod/src/brain.rs, maploc/src/mapper.rs, sounds/src/chorale/mod.rs, robotd/src/chorale.rs, autod/src/main.rs, sounds/src/stream.rs, robotctl/src/duck.rs, sounds/src/chorale/midi.rs (\u002B34 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8c379348542d6ce695a90957a5ad3074a324e74031e0f600e3e84a0ac8cc7da0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 39 significant file(s) lose their only recent owner: mediad/src/relay.rs, configd/src/nm.rs, duckctl/src/udp_pad/panel.rs, spaces/policy-playground/web/src/main.ts, configd/src/net.rs, mediad/src/turn.rs, spaces/vision-demo/app.py, updater/src/robot.rs (\u002B31 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3a59826988d04f1a03b6c183481c97e436f16f161cacc711e71ea7278f11c00c"}},{"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 (82 single-owned of 241 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; 241 of the 257 production source files in this repository met that bar). They are anonymized user #3 (1 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: robotd/src/posture.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D20","level":"note","message":{"text":"ADR consequences name no cost: \u0060docs/design/updater-design.md:1319\u0060 records the good consequences of the decision and has no section for the bad ones. State what this decision costs or rules out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/design/updater-design.md"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76d12472659cdd7cc4f8138afd7bda2140ac00010993b88fe0558966ea5ca35"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 34 project(s) overshoot their size bounds, lowering Project Cohesion to 9.5/10. The most over is \u0060duck-ipc-proto\u0060 (8647 LoC, 197 module-visible types across 1 directories). 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":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"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":"4f38105ec2d1d3a9f97c1e511c525c3b866aa11026102a01e225dbbdf588a46b"},"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":"d845008cc559c465a18cb05fa735deb4c08b3282385060c6edd547d35dcd6bbd"},"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":"d99840d500652297e26ece22bf0d68fb373c4ddd171446ac82ec46e420967197"},"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":"48e3f0a8d715162f89a8145cebe6b24649bce87c15bddbf8d99a669695dfb057"},"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":"129c3e98bf027353d5aeef71e5bf36c5d842129221f64c4695b9245030fd808a"},"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":"2129223a2ceb8cfc04ac8d4edd450a9dbd20536abae067f1d0102ef0f31ffef4"},"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":"3163556e9b37816979f484087b4dbf3e67cc9b97cb6700261c34873a6647e3df"},"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":"fb1d47dd9a1e1b6d0777c4c776581d56cd621a67b6e99cc4805b83b0404f07d5"},"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":"ee23f86f3b529b484391fe45b94ff2181e24d196a98ba51ea549eb275d86bc80"},"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":"9d40cede01e346077f2be4d7885b988226addf060ad63800dc006ec2cc1754a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2e3b341c8b65b383d44f7abddc36cccbf724cdbe50bce7a663c07f80d44f52f"},"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":"0aaac4e166947b6fbe6948aa55cbccb014fd41016b7fba94bf0cb7470af87b1f"},"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":"3018c374e2e9c7b511078c4c9772ae8f8be2ea102d04dec12826041ab542b20d"},"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":"9c9efdbd1796ff6dcd65d559918fd4e7654df2270ec97f0a2959dfaa7161b240"},"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":"6560f265b09364c6250850b7a51ffdc58f59b21550e8b04e0972697114a61578"},"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":"85364f1748c69179bdedcc4e11279d971ef8591555a0d0820c2af3fed876ad9f"},"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":"302195100311ee3f943e7aa3d37f671cfd49ab02c972f10c3b60da8e730f7cbe"},"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":"e1eb94f8c6a0f40dded6a5208b2426134554fb0f5690700876b46ebbd41a7f0b"},"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":"40c80f1cdae728dee45851deb30af5b20cfc6c546050918ea8de2a5db85afc9b"},"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":"e595a38825f47c13052e0d149ea3fde14cd82d74da40e3df54de193f476529ea"},"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"866f5db9e17cba13054be81498300d5689d6380b38ab693dd948f99e20adbff5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54015389eb5f9a0beb6433e209224f32665bbffd45f48b4ac71eacdc7584cddd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b549d9de0052cdcf3a0fd587b9baa6d0b3f93fe1c813085c4da28502a20e77b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05dd1cc6a6536213feac72458953b3ecc92da85b7219289a9d2c68054660f8e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58416306c1a27a37c4768b939e55dd2865e8672774adab59964be2ffeffdd74f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53041d0452eb7a0f6d7363cca46cccfc47fe77904a465fee573e39f7c59d9395"},"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":"c52164266fcb7e0daeb69466e90e70cf55f61b711dad3de792b478f4bd542aa2"},"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":"9258488a9063d06de578a4e9568800b9f0c55ad1345e829d7ac39a2ae11e4f87"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcfa4da9215284db6a6355a359d46e54ece6d33a8e6548e02570fa88e565fa20"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"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":"a1873f73df2980e05749fb989e4983bd7e44b6790994284629fa7f4a2ef29ad4"},"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":"99c8716916ca0dd9ddee8302208a5745bab6513f34ca12c2672d93f07c07be5f"},"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":"cc8b8cec5bab8a78c112d2579123538682d6ceab8113091834d3a36af69552d0"},"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":"8e507844d9e29fe4e32c427b050c7736a02e75f8a3d95373e2469a28c729e1b7"},"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":"947ba76d4628ac852b722d0a2f2638ba590702151ec71657920a1fd55e8cc215"},"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":"6e31fd2f0f817d6c2089419e2e061473f2542d709ca00cd177477cea7fc71afe"},"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":"6cde03804f4b3aee6750b50681ec93104d9b02d52f0389dc3fe89d2ce236dba7"},"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":"76fac36c6dff6ac34a57fd8b18ae1bb45fadcdf80ce311d4dd20e917a7b9918e"},"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":"82f8a289a5c2406f37c7c37d3f9cd74d4edd29c100d1930dcf816f0c999352b3"},"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":"de78c66291369eccf94d359ec0c66ce05c2b90c1ce54745bc8aa1eb34a5e2677"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f992c677c89ffed25bc00dc536a3b423a1884cfca2ca11fd44598d1cc70d2cd"},"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":"05de2bde964dc16374ffc30f445ef191c195d49f90e64d593705bf50f840f355"},"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":"23c1ea6d7743659f2597ebb65f0009662b1d350572f19d8aa8d61a7c18e9117e"},"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":"8baa5056958dcdccda99aa354e4db832198919dcd98e81efe0998550488cc4dd"},"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":"0003d7b67f4a51db0fdbe375936b9f3081db5fc2e73616bf46a06e58368e49db"},"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":"aa8374066b9d04dba58772d87152ecefd61c7de477c2ad56f51709dc6e10855a"},"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":"dacc0fbed831c5151c2e1f5b3a0730978e5516371200e85cac1f3169f4336dd7"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bc85f08223fa72f6176541465286af52cf535be4cfe4786b746baa901a8333f"},"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5a94de598d5f66dcc4ccfd4adeb9bbd82d59e61120ddfa86a1354ef816f7094"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94112b1d706b2f9d9118c577518290919c2d702aa0b944fa06a5bcbb51101185"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"495e1b0b2a07ba00a8ca73daffd305231bf5656971e4f9bd36bd2a4c3ca2618b"},"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":"41e0f49548014cf82486708f896a71e4acf812b40811cf5743dfc6d47b24bf72"},"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"}}]},{"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":"9fbf9fe2ae82cd47d5f154d4e0cbefab91d2b9e2b43c5907690379fc6890063a"},"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"}}]},{"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":"d3ea0693aca26f7d17591e165f0eef28b424a24a8b852092ff74cc09ea3fe4d5"},"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"}}]},{"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":"28c806bf4965eca2a179ce979123df96d8087067b8ae261d7b5c1fddabf4b015"},"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"}}]},{"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":"9aee9527e1276543253d4a33040f65a3ff218870a17b7056b69afe973caf7569"},"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"}}]},{"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":"b89c936d2f72d26a51da610c25fccabf7b0d67bd9fb021a297cc261a2c177bbf"},"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"}}]},{"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":"8ef72fd22bceb01e9ba21d28e1eca453407c18c73eb311b7d050480d243c62c8"},"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"}}]},{"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":"c12d77a046be3c491ba9121875ddb72d7b4c3de475f223aeaa914b9069c33928"},"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"}}]},{"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":"4a95d0211c5425e9811599eefb962fe894baae264cf3bf727250667524d143e3"},"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"}}]},{"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":"808a257ad2e0139c7efe1aae4e437560ecc72ee91fb9206d5d4e3aca487a1ba3"},"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"}}]},{"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":"e05bf4826423a9f77039c6cb4dfc3312f0d6c72633e62839f69d8b803205a59d"},"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"}}]},{"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":"feefe3ddda21ffad04e3fb13e7c4469ae2cc02924a73ffefc1c031142f21f819"},"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"}}]},{"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":"2b71f60856a9b54d0d6b2b4bca999af438d592553ea62f9b530cba6abfe54d90"},"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"}}]},{"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":"f052381440c941d33a0cbbf777d17483d3b6bd4d36d5ea4077c67f7bd5a7dba9"},"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"}}]},{"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":"ad2b2cd9a703d68d435c6273b11ac631ab8c30d3088b23cb356c5fcc2d91da86"},"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"}}]},{"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":"b60f929929e2f368dde6f346e814dd68cee0b3e5c00f7077b68b73048378a295"},"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"}}]},{"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":"c45aca8cc8b6997f9273876813860a187bfaea9e675ae243c17185c5a9b42e3c"},"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"}}]},{"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":"513fee054fadaca0334d249855f665b14f1dc6c60315616a9563ceae098cd822"},"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"}}]},{"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":"2133a8c81131864f60647d3f47d16be9790dc48ee900b5d203fa2856f85f525f"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e06c4c144999d551e6fbba9dd4e56dbc2fbd94e2a305a26b8acb81c5c4538bc6"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18b10abe0aaa06d71035e204b01b28fed393be3e73fe4c47fbd6ba0577b8ed3e"},"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":"2538884e9811f55ff2a85f2305a683da7151bfdf0606c6dc5f6ab415ca935603"},"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":"fb22ec226b5f1239c6192f47ff97c6744e188df3a1ee0420158b4755b1c128fb"},"taxa":[{"id":"CWE-327","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":"924c726b6796c63260d38edc8d35e80d770b6f5f051243400cafc2bf82d757a8"},"taxa":[{"id":"CWE-327","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":"c02eb17cfd87c7bcce427c3fab860ea1c4cb91a819c650fef96b8ec76fac5a2f"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d9b5494fbee60fcd85a3eae2d3973300a0f9339e752343597b0a325bbca3b08"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbfd96f26ab07bbafb36885e3f13b657f25ae6167406d35292b22115e36fd0fd"},"taxa":[{"id":"CWE-327","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":"c75adb92445f709e2875c92fe2eb3b3d0a9dc6149e778b2fc2cfb8ea1c76ca1b"},"taxa":[{"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"642efbd6ff8397003a7d6b88bc5600b6e62aba767b08d3d3c271033add1e9f29"},"taxa":[{"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":"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":"8d503622cd864ad1abf1e850a51d032e629f951fa7abbdd9273b09f984fefeec"},"properties":{"dependency":{"package":"gradio","version":"5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-1410","PYSEC-2026-1418","PYSEC-2026-1423","PYSEC-2026-211"],"reachability":{"kind":"production","file":"spaces/hello/app.py","line":11}}}},{"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":"1b7de736f71a5a6c0a7bf5a972f85921c847e102bb78e1c2b9d5a1b769e523ef"},"properties":{"dependency":{"package":"gradio","version":"5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-1410","PYSEC-2026-1418","PYSEC-2026-1423","PYSEC-2026-211"],"reachability":{"kind":"production","file":"spaces/vision-demo/app.py","line":38}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.15","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"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","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"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":"22995033016ae3861d571b2c92ada6244555e3aeec08bc870b909cda12b35c06"},"properties":{"dependency":{"package":"rustls","version":"0.23.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0347","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.8","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.13.1","advisory":"RUSTSEC-2026-0370","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.13.1","advisory":"RUSTSEC-2026-0372","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":"a64fc08866885a7490aaa4eb9cef53c3f8357446fe86a7ada11727cc05296b31"}},{"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":"625e12e80843e95391d5cb320ab029e080a82b466df7c130f2d2be3361b4b4d5"}},{"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":"2d0e96ae2473469403eb0fe06a075b66d19646556d022880742f7f1c9a9baf88"}},{"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":"579ed4df143d09f5e46de6c0b97f27dad58e1669be158385fe5817b3e69a3bed"}},{"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":"90408d2538abc21ae13dd765f56ab85caf431b56bf19ac20383a1417c021f530"},"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":"40e1d50ac3c36b0d366a2e10f836bf4b733cb0492f76ddf607f9ee3945cf37d8"},"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":"1a7d07d2b86f1f3fe3ed50824a89725ce5637052523ebb2ee3008b8deb260cfc"},"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":"b424d82473c227da648f8a611c6b85aa08a66fa4ea5c2cd2abd20acce2512f29"},"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":"de58b797d0d899508c5562319e0d072191db69f8ff1bb3be41edd394700f4072"},"taxa":[{"id":"CWE-527","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-538","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b9dac3884db7ee15de2b67738984b10ebf3d340dc156fe8e92a85ef0d7a60f86"},"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":"204e7d81b4e864e6630b206cd49358ae28324f40cbb5b9963cd307e4cae4cd78"},"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":"d6d3a4ab93298f835eef3366ce5e53a33f93c46cf77d77c81193e089dc76ec84"},"taxa":[{"id":"CWE-527","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-538","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b8779af7a6808ccb754e717f325db237decc84560abd473b7e159655b05324fe"},"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":"87c947703fc53d8ea69a63297c60edf498ecdf28322e9a313fc20ff7da876b59"},"taxa":[{"id":"CWE-527","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-538","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"347fc47e7a3b52e1a30149e73c8be40590a5fb6eeabdd78c83e55ff9e8c78b9c"}},{"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":"8ec2829a61fe64fda1fee8ba424361cb77c9dec91beb4abc1179f40ee0de4634"}},{"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":"7b2dd3bf46448ef6a3978015d792cb2bb64b7c38d16204994cb450f38e925440"}},{"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":"5aa6086bf92163d316fa17a19863b6ecc0697ccc82877e5d9d036be45a2239b2"}},{"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":"d4dc29aa095db26417bb5063edb243c68118050dbd5ade4ae78c0c65189f3195"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: route.rs \u2194 ipc.rs: \u0060mediad/src/route.rs\u0060 (context mediad) and \u0060updater/src/ipc.rs\u0060 (context updater) sit in DIFFERENT parts of the tree yet change together 76% of the time (26 of the 34 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 26 shared commits counted here, the most recent 3 are \u0060843a2340\u0060 nfc: read a tag on request \u2014 robotctl nfc-read, duckctl nfc-read; \u0060fa16f967\u0060 autod: the duck chases the laser and plays with the ball; a tag switc\u2026; \u006082cb0308\u0060 Withdraw system.openWifiSsh: wifi ssh stays a decision made with the \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/route.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7eaaa7bdcfa7689e086873d547936d73ed070de72aa92c992aa6815154d988"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: safety.rs \u2194 main.rs: \u0060duck-control/src/safety.rs\u0060 (context duck-control) and \u0060robotctl/src/main.rs\u0060 (context robotctl) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060909478c8\u0060 robotd: a servo unplugged mid-run is degraded, as at boot; \u006082fe4678\u0060 The vet book: a lifetime record for each duck, and robotctl vetbook; \u0060f732cadf\u0060 robot.rebootMotors: reboot servos in place, \u0060robotctl robot reboot-mo\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"duck-control/src/safety.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86874ade9822e5c0cd96e917e0231b86abc6035f064b0bc39f6a69cae69b239"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: route.rs \u2194 ipc.rs: \u0060btd/src/route.rs\u0060 (context btd) and \u0060updater/src/ipc.rs\u0060 (context updater) sit in DIFFERENT parts of the tree yet change together 67% of the time (33 of the 49 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 33 shared commits counted here, the most recent 3 are \u0060843a2340\u0060 nfc: read a tag on request \u2014 robotctl nfc-read, duckctl nfc-read; \u0060fa16f967\u0060 autod: the duck chases the laser and plays with the ball; a tag switc\u2026; \u006082cb0308\u0060 Withdraw system.openWifiSsh: wifi ssh stays a decision made with the \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"btd/src/route.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1e2c81c8c3343b0624b0d4b4451fd1d51bc9123f15ff7ba5a39c6d1c02be4a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: main.rs \u2194 config.rs: \u0060robotctl/src/main.rs\u0060 (context robotctl) and \u0060updater/src/config.rs\u0060 (context updater) sit in DIFFERENT parts of the tree yet change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060db7f0311\u0060 robotctl configure --allow-dev-daemon: a dev board in one command; \u00604ba09e0c\u0060 Declare the board in robotd.toml, and retire one with a single constant; \u006050bdd665\u0060 A robot can belong to a Hugging Face account \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a066c8dd98e61e1280e10faaeaff6c2adf735242d807a64ee00166a844d5d296"}},{"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":"e8106c67b90dbf97e433a2bb2d22fb46b688de71a280fabad5885228f634ae96"},"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":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b32de0769cd1fd28872f417ee679cecda1851e67617c0e6228e16ff7c47e38"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f90c566d8e9a9b9b8dd03e3496df4714e7eb97fb158772153c1d2d6e7cd8a44"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4161fd54e7382e65cc6146df15afe4435e198832441aaa2e158a5b797d8a95b5"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/vetbook/card.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6e71fcef614d23c357b553e283a61fd519c45d8eb68ad9f09da8d70f15c7e6"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/vetbook/card.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa68f169c55eca9622d73e3843a447fa239e02ebd9465b918bf251d549c7163"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/webclient/index.html"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7c1be5f923c08b169c07da21848b09bc123a0f2d8bbcae596b08a072cb211b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.1:1): \u0060.chip-live\u0060 sets color: #1f9d55 on background-color: #e6f6ec \u2014 3.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/index.html"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d94cee887071e99341d4aa2b01c235c9e8587d7a732909eebd96a8d0a100174"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.4:1): \u0060.tile-off\u0060 sets color: #9a8a4a on background-color: #fffdf5 \u2014 3.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/index.html"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a42962becf5390b62633fb259613a1d94eabf69544c08e2ea621b61aa94a292"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.5:1): \u0060.control-start\u0060 sets color: #fff on background-color: #1f9d55 \u2014 3.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/index.html"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd797a3d521deb37a0771efa4676dc287672dd2971ba5b0d0cbca7c7ce5f7fc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.9:1): \u0060.chip[aria-pressed=true]\u0060 sets color: #fff on background-color: #ff5c9a \u2014 2.9:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/vetbook/gallery.html"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde00deb559ee58c80c48cacc08394507712f68c1031e72bffbf5aa23af3b49c"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: content-security-policy: The live app\u0027s responses did not include content-security-policy (restricts the sources a page may load \u2014 mitigates XSS/injection). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b142e47096a32517bde0bb9b78f7e564119c7f87e22fba4dccc0d1e3645d74c5"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-embedder-policy: The live app\u0027s responses did not include cross-origin-embedder-policy (recommended by the OWASP Secure Headers Project (value: require-corp)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"153214bb9c80f7d66cba8eb6a7715e9609e84c3979c9b641cd6bedaa8be6930b"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-opener-policy: The live app\u0027s responses did not include cross-origin-opener-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8cdbe5cdec6a55c732bf9a9975c0e40f81ddfa4ad583a4a50bfb0895531607f7"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-resource-policy: The live app\u0027s responses did not include cross-origin-resource-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ba35c34991db9965777a53477c2d497c4c6606f78d133bbaa3bc99c71648c2a"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: permissions-policy: The live app\u0027s responses did not include permissions-policy (restricts powerful browser features (camera, geolocation, \u2026)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac8a111f0bb913829dc090833718dca5ab8e5fba7350f9dcf68f1971010745"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: referrer-policy: The live app\u0027s responses did not include referrer-policy (limits referrer leakage to third parties). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"364ee3f006b552b8fee33710a1fbfb0c4fac59e927af9c4396e51940d9069f01"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: strict-transport-security: The live app\u0027s responses did not include strict-transport-security (forces HTTPS on subsequent requests \u2014 mitigates downgrade/MITM). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"567d3eeb50a5678c0139a1d316c614c44cd4c4fb5db6fffa7795bc73d035966f"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-content-type-options: The live app\u0027s responses did not include x-content-type-options (stops MIME-sniffing (expects \u0027nosniff\u0027)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e7f2638203ac91f5b64c739d090b339c00a90f1007c83652152b402a6eb0cdeb"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-dns-prefetch-control: The live app\u0027s responses did not include x-dns-prefetch-control (recommended by the OWASP Secure Headers Project (value: off)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50e54b8511264dd930857e4620bda8ba4053661b439218ed047812bcab0e3a44"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-frame-options: The live app\u0027s responses did not include x-frame-options (blocks clickjacking via framing (or use CSP frame-ancestors)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e84499d19780ca121fad65e0f3bd2fc17b1268ce3079a5f40495749c54dc87e"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-permitted-cross-domain-policies: The live app\u0027s responses did not include x-permitted-cross-domain-policies (recommended by the OWASP Secure Headers Project (value: none)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55366a3d9fb1c5952ebc54aab272eb775bf2c1b056d6d399652365c26cc2375b"}},{"ruleId":"AXO1","level":"warning","message":{"text":"API operation answered with no credentials: GET /env: http://127.0.0.1:32768/env returned HTTP 200 to two GET requests carrying nothing. Observed on the live app. We do not decide whether this operation is meant to be public. Advisory evidence for CRA Annex I (2)(d) and NIS2 IR.4.1."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"87b3e4c504f42e541444bd452bd426be434bffde4b14e34a8ccc0dc3b16a83d7"}},{"ruleId":"AXO1","level":"warning","message":{"text":"API operation answered with no credentials: GET /: http://127.0.0.1:32768/ returned HTTP 200 to two GET requests carrying nothing. Observed on the live app. We do not decide whether this operation is meant to be public. Advisory evidence for CRA Annex I (2)(d) and NIS2 IR.4.1."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"db40b1eed2b18a2f9c294782d8fd7487f4fb69d920f5b40b05f794232b8eeab9"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 2.4.2 reproducibly failed in a rendered surface: axe-core rule(s) document-title failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a152f745c16f064aeb9932e5d52584f548c37c248ac45bacf96a1a6ffc2e49e7"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 3.1.1 reproducibly failed in a rendered surface: axe-core rule(s) html-has-lang failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2d0e1d2bf07ce04d82230fe7847e003479b78cd188efe60cc79686fb8ba8420"}},{"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":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 2 ADR-shaped document(s) detected by content \u2014 \u0060docs/design/updater-design.md\u0060, \u0060docs/project/ci-setup.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 21/27 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060duckctl\u0060, \u0060robotctl\u0060, \u0060sounds\u0060, \u0060spaces/hello\u0060, \u0060spaces/vetbook\u0060 and 1 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060spaces/policy-playground/web/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/web/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4ec3753c2f782b91d974b7873a153f736c8b8d26b33daf66e5b93184e74898"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060serve_looks\u0060 is async and calls thread::sleep \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mediad/src/laser.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3eb69bf8e56b369732b867b88a33e6d284093d4c22f6a510f6fd03efab25ac"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (mediad/src/web.rs:87)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"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 set on a response this repository\u0027s Rust server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (mediad/src/web.rs:87)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"S1","level":"note","message":{"text":"No inbound request validation detected: No handler of this repository\u0027s Rust server answers 400, 413 or 422 (\u0060StatusCode::BAD_REQUEST\u0060, \u0060HttpResponse::BadRequest()\u0060, \u0060Status::BadRequest\u0060, tonic \u0060Status::invalid_argument\u0060), and nothing declares validation \u2014 no \u0060validator\u0060/\u0060garde\u0060 derive, no body limit (\u0060DefaultBodyLimit::max\u0060, \u0060RequestBodyLimitLayer\u0060, \u0060JsonConfig::default().limit(\u2026)\u0060, Rocket \u0060Limits\u0060) \u2014 nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (mediad/src/web.rs:87)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ffa303f3c9cef4b4c2cf028a78ce2f3c83f6078f80716eea7362fad047265eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022, \u0022.join(bits) or \u0022nothing \u2014 no telltale headers and an empty body\u0022\u0060 appears character-identically in 2 files \u2014 spaces/shared/rendezvous.py, spaces/vision-demo/rendezvous.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/rendezvous.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb2f65d0ffeae6341df042e2ed3ceadd4ba1e18f0092035745779fe9a761c7b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.get(\u0022peerId\u0022) or entry.get(\u0022id\u0022) or \u0022\u0022\u0060 appears character-identically in 2 files \u2014 spaces/shared/rendezvous.py, spaces/vision-demo/rendezvous.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/rendezvous.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"41788a5fa8680998628025fbced89f1ca4cd2a9416fcb9a262ac802fc8f403a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.get(\u0022message\u0022) or \u0022refused, with nothing said about why\u0022\u0060 appears character-identically in 2 files \u2014 spaces/shared/control.py, spaces/vision-demo/control.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/control.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"af913704baa382e933c2b6548a5a70af553b5e0289d22f9511069110e1fea8a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060flag is True or str(flag).lower() == \u0022true\u0022\u0060 appears character-identically in 2 files \u2014 spaces/shared/rendezvous.py, spaces/vision-demo/rendezvous.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/rendezvous.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba80f81e09d7f5007ecab867844b691952408e0f9dfd72a2984631dea3a0797"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(body, dict) and body.get(\u0022type\u0022)\u0060 appears character-identically in 2 files \u2014 spaces/shared/wire.py, spaces/vision-demo/wire.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/wire.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf6ace9ac66e835cd45f6ae130ac1a0c005eb0a87eb837b836bd4bd66ce61a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060meta.get(\u0022name\u0022) or entry.get(\u0022robotName\u0022) or \u0022a robot with no name\u0022\u0060 appears character-identically in 2 files \u2014 spaces/shared/rendezvous.py, spaces/vision-demo/rendezvous.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/rendezvous.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e8c47e6931505a96d9746942c8c9f3a58b46cfbd7eb1ba65cdf1e73725e878"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060meta.get(\u0022release\u0022) or \u0022release unknown\u0022\u0060 appears character-identically in 2 files \u2014 spaces/shared/rendezvous.py, spaces/vision-demo/rendezvous.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/rendezvous.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8416a34efb89b82278c48443209c378d1cf27834ca14a222f2a1c684c633eda"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(\u0022HF_TOKEN\u0022) or get_token()\u0060 appears character-identically in 4 files \u2014 spaces/shared/rendezvous.py, spaces/shared/wire.py, spaces/vision-demo/rendezvous.py, spaces/vision-demo/wire.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/rendezvous.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"530f7ec7b7614aba162243e1fd40206e3f6dabbc1111d5eaa7bac44e505bb3c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(\u0022SPACE_HOST\u0022) or \u0022absent\u0022\u0060 appears character-identically in 2 files \u2014 spaces/hello/app.py, spaces/vision-demo/app.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/hello/app.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe81cecef54c8aabb3e1fcef333a41ff0d1a104e45a56fff5941ba355fbaffa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.error or \u0022the rendezvous closed the event stream\u0022\u0060 appears character-identically in 2 files \u2014 spaces/shared/wire.py, spaces/vision-demo/wire.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/shared/wire.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efd565a845d3451ec291d6c0b0f49142d27de3a2a7ace71d3aa1d5d6d3d4f05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003E= 0.0 \u0026\u0026 j \u003E= 0.0 \u0026\u0026 (i as usize) \u003C w \u0026\u0026 (j as usize) \u003C h\u0060 appears character-identically in 3 files \u2014 maploc/src/field.rs, maploc/src/grid.rs, robotctl/src/map.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":"maploc/src/field.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5582b59ce8eca2e0092789122c571ba99ec23583741182e87ea1708bd567d059"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left \u003E Duration::ZERO \u0026\u0026 !shutdown.load(Ordering::Acquire)\u0060 appears character-identically in 2 files \u2014 robotd/src/head_imu.rs, tof/src/imu.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":"robotd/src/head_imu.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6135607f3e1adaf3633669337180b78bf8bfceb12be7dfcc1fd866cbb641009a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reload(shared, config, stamp, checked) \u0026\u0026 shared.params.load().detect() != detect\u0060 appears character-identically in 2 files \u2014 robotd/src/laser.rs, robotd/src/soccer.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":"robotd/src/laser.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad406359466d3bece6e9453df5bfe525ff7a9def9959c84c11467156aea3fa4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u003E= 1000.0 \u0026\u0026 unit \u002B 1 \u003C UNITS.len()\u0060 appears character-identically in 2 files \u2014 robotctl/src/show.rs, updater/src/engine.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":"robotctl/src/show.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a56e143b3bbd8015f590240a9c30d15b060e54e2ec4f8e9ca5cfeddcbd30750"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/4 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: manifestOf: \u0060manifestOf\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/web/src/hub.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"04759dd78b1ea0056e8a16ebf98c6eec022653ea10cbfe9256080e7ec4341af9"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: readHub: \u0060readHub\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/web/src/hub.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ee97e2982a7c20a202bcc5c142259e2f901177ef75d37d973c3510497f785f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: listDucks: \u0060listDucks\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/web/src/rendezvous.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"263b7b3430f4a146ca5b9c273e48a21abc26811e7599bcdcfaf1eef01721ef99"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: post: \u0060post\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/policy-playground/web/src/rendezvous.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f7b32e7f0533760e42702d6434120967863ad93a659b832fc527579ec02e20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 213 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":"updater/src/hooks.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4d9e5f537eb211f482c1c7d0f329e90d3d7daa568e3d9ffeb95ffdd48ce7a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2965 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":"robotd/src/main.rs"},"region":{"startLine":2965}}}],"partialFingerprints":{"codehealthFindingId/v1":"14823fa7b7d4a9ab7673cd8744c3d1c406f0ea6c91843726556e1421557661dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3909 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":"robotd/src/main.rs"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"a352c8cd1f218b7103ff2a57aa9ee6786f9788e1a38007a0d08d552dddb68215"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4151 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":"robotd/src/main.rs"},"region":{"startLine":4151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d980ade3480234dd91e9deb3705836ea5591e3df02aa02f6655a4e44dd11b98f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 231 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":"pad-map/src/mapper.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac497ab2461b3c4675430a36afe586776c103cffbc4caa9c2001b5c3fab29d26"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1253 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":"mediad/src/pipeline.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb3afc4baa258b1cc77c47174e8f003b8e1ed6eb6b52135e635b12742cac673"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1256 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":"mediad/src/pipeline.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c08f4fe61a2f660856b5c8f99725661c169338af41670a5e3ade0eb49a97f8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1259 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":"mediad/src/pipeline.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ecf05495c485e3efb089d4d0c0f08f5dae2287c1f1846ab0fdc6aad143d548"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1261 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":"mediad/src/pipeline.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"816b1e1ce70cb3e3a9fcb79eb2acf67735e441e714a4c7ae96dea99d1c416331"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1702 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":"mediad/src/pipeline.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"21efe89de53b7faae4fb2c9fc71e9ebb20707c1ed85687c7625183e98f123df7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1712 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":"mediad/src/pipeline.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"e575c947e2e80238d9bb802a72bd94cf92ebaa43741d50936c30360d3d7b0aaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 406 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":"mapd/src/worker.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc0e7a5ee844f3e8fc438d18be5686f85362f59199c81b51f75967c617f7f48"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 172 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":"duck-ether/src/main.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"886f821ea035f96b90bc9ee17a4e60d1863a027b2c0e1276e629e9226b0e7a97"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_num\u0060 returns \u00600.0\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/vetbook/cards.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"763cf7a7c81c6545bb17b53e93e1361012f356be09bda47bf269fae36214a9ca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060num\u0060 returns \u00600.0\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"spaces/vetbook/traits.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"afadcdae5d34b408d80ee08b253e2cce8d8eb88d6be7bd95b1498898edf05bc5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060installed_components\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4447ce4441c594ae551d1ba8f0007e43f86b2e6d49a47885cb1514146ac4dd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060check_sources\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/main.rs"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e2dc55392d815bf57f56a93809de50e11a049faddd45675a6dca6eb971123c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060by_index\u0060 turns every \u0060Err\u0060 into \u0060-1\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robotctl/src/endurance.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c899b291e087b34ea2f4bccca7b0eca34a3c57fef2abd96e3a0f2a0851f921c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060would_orphan\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/orphan.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4a201257c24730623492585327a0ef47063558e8d7a0b2e12334c2966d61d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060installed_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/policy.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"349b22abf64a50a216b44fcb49dfa0ad1f0d03945b84f2f2443409b58b8debf0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060files_in_manifest\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/policy.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acfdebecfad9322c6403d2f9affcf72f13963763e0639aa8cde8bf86f979bfa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ids_in\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"updater/src/transcript.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa159fdb4a0e91a057fe30b53e7c22a1c7ddd460a730d1ddf5c5b6546bff182"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.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-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-527","guid":"79b27cde-9d04-1a54-b64b-d5bb9b4a8ee7","name":"CWE-527","shortDescription":{"text":"CWE-527"},"helpUri":"https://cwe.mitre.org/data/definitions/527.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-538","guid":"3baa1f05-df1b-ae58-9ee0-1d790ff4a989","name":"Insertion of Sensitive Information into Externally-Accessible File or Directory","shortDescription":{"text":"Insertion of Sensitive Information into Externally-Accessible File or Directory"},"helpUri":"https://cwe.mitre.org/data/definitions/538.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-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/"}]},{"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":137,"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."]}]}