{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"],"owasp":"A01: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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::run_command (cyclomatic 215): horus_manager::run_command has cyclomatic complexity 215 (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":"horus_manager/src/main.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7abc04ef8deaf111694980dda1618ac6ae8cec54969c80c4bfa0bd7435cf084"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::check::check_manifest_file (cyclomatic 100): horus_manager::commands::check::check_manifest_file has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/check.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c8e894c55adc1675863eb73ab8d28deffe8fc9590c7debdb94a317fb6307ee"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::check::check_workspace (cyclomatic 82): horus_manager::commands::check::check_workspace has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/check.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a116956900a2cbb1fac96e32249f944468a97bba8c8b46ae18b7d44bd983f373"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient::publish (cyclomatic 76): RegistryClient::publish has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcff76bbd6050abc965bd27f9d9972c781a7e7ad92382faa444767d1440ce4e"}},{"ruleId":"D1","level":"warning","message":{"text":"RtExecutor::tick_node (cyclomatic 61): RtExecutor::tick_node has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"141fce420d95d3f61ba2611f1632551eb3df987b60231789aa5a03439f0b820d"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::launch::run_launch (cyclomatic 59): horus_manager::commands::launch::run_launch has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/launch.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50137e7ceb20678956ff79835b2482ff9f797bd45d0005ea29815a18252998b"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient::install_from_registry (cyclomatic 52): RegistryClient::install_from_registry 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4697e0c1ac68abf5609c8ed01db63fe10ec1cc979b4f8cab1ceafa59b58dd9"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::run_with_filter (cyclomatic 48): Scheduler::run_with_filter 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0b64222940e23fa6cb93dbbe3f21f60c17a2075cd27612585d033e7ab8b0d0"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::topic::decode_pod_fields (cyclomatic 45): horus_manager::commands::topic::decode_pod_fields has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d03f3e1f407a2ad3a55e361894b055c1fd55a7b9a2d0138e0677e2ff63e9fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::discovery::nodes::discover_nodes_uncached (cyclomatic 45): horus_manager::discovery::nodes::discover_nodes_uncached 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":"horus_manager/src/discovery/nodes.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d4f95add563ccbf50e6674986af1cdecc3aee90c84207bbaa158936f919e3c"}},{"ruleId":"D1","level":"warning","message":{"text":"RtExecutor::rt_thread_main (cyclomatic 44): RtExecutor::rt_thread_main has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c1555cc92c550358c127ada7f85faecf516e902e28c673b3a8e6d29ebcdf51"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient::install_binary_artifact (cyclomatic 39): RegistryClient::install_binary_artifact has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"a287acf4fa076cf84231f62ed0b80b3ac6503b6ea1058b474dd3ff55ebb325c2"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::node::list_nodes (cyclomatic 37): horus_manager::commands::node::list_nodes 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":"horus_manager/src/commands/node.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914ea33fe720b68db399f55fdd8a5e4b52cd948faeb1b81dbffa2ac461a2db5"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeRegistration::validate (cyclomatic 35): NodeRegistration::validate has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/node_builder.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf83138ab070688480fe5b82d917e7aa28001aa176ed20907513a60b04d6f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::pkg::run_add_dep (cyclomatic 35): horus_manager::commands::pkg::run_add_dep has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e759f5de21bb8e5a3be454b62cbb263cd3efc9faff39a94af812786e025091"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::check_timing_violations (cyclomatic 34): Scheduler::check_timing_violations 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5905}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71eda0eec07f044bfdc0fafbbcd70773006cf4100cf64b1705fe8a86bf30ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::action::discover_actions (cyclomatic 34): horus_manager::commands::action::discover_actions 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":"horus_manager/src/commands/action.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a99e68023ce0f72bca92fc8daae9657d1c319c42e059cab12612729b983c02"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_core::services::server::run_server_loop (cyclomatic 33): horus_core::services::server::run_server_loop has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/services/server.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"851acdc31da9acf34d7048a6516107e1467843a8532e000950297589d7f5e0de"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::error_wrapper::cargo_error_hint (cyclomatic 33): horus_manager::error_wrapper::cargo_error_hint has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: horus_manager::error_wrapper::error_code_info (cyclomatic 46) 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":"horus_manager/src/error_wrapper.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eb1df2976fe69ca3feb9cb4f2da2c358f73a9ff7558abf5a40ec252a7d467a"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::clean::run_clean (cyclomatic 32): horus_manager::commands::clean::run_clean has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/clean.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b259a68715f258775081102f48b2529e5a64cac575a45fe11dd9c11d5f0f6bd"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::run_rust::execute_build_only (cyclomatic 31): horus_manager::commands::run::run_rust::execute_build_only has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad0c395983b83136454ac045e81a3b0d0bbb4f9a7d2e86d90ce3a79b64463c5"}},{"ruleId":"D1","level":"warning","message":{"text":"EventExecutor::watcher_thread (cyclomatic 30): EventExecutor::watcher_thread has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/event_executor.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"891c24d375e8a9891f38c65f9362790abd5161fd6fa47001e35799c0fd86a078"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doc_extract::format_brief (cyclomatic 30): horus_manager::commands::doc_extract::format_brief has cyclomatic complexity 30 (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":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e1bb3bde6a01f94679a2c1dcef2c84481f3bdd35b99455201247e9bc0819b8"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::record::run_inject (cyclomatic 30): horus_manager::commands::record::run_inject has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/record.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc43ea3a69d3c103e98f2364dcd9027b3ff97073902551f5c1b365efcd2803e7"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputeExecutor::compute_thread_main (cyclomatic 29): ComputeExecutor::compute_thread_main 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":"horus_core/src/scheduling/compute_executor.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce838a10adec9c75aaff4b67715d08448597520d7e4416e76877c7b5181da8f8"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::migrate::run_migrate (cyclomatic 29): horus_manager::commands::migrate::run_migrate 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":"horus_manager/src/commands/migrate.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdbf04b5f8e3136d21caf1be244df6f0ec40fe4315625e8acedc04ca67aa7b7"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::pkg::run_list (cyclomatic 29): horus_manager::commands::pkg::run_list 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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd67a118a34eefcf4069422a12f65f6ef63fc05a8676bb47e09aa8412da0c03"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::registry::helpers::prompt_package_metadata (cyclomatic 29): horus_manager::registry::helpers::prompt_package_metadata 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca96f327dd1c19fc054241e3e5cd2c7c9c79f183d9cedcbcaa2c3758fe48bad8"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::tokenize (cyclomatic 27): Lexer::tokenize 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":"horus_manager/src/msgspec/parse.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff05ef209de5836f79b78d621a86438e184119f72874cceaa305a544366fad6"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient::update_packages (cyclomatic 27): RegistryClient::update_packages 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a1f98ed20ea06de0d910ad63b6c08293f8137bdb1fc120426926c485bda189"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::plugin::run_info_unified (cyclomatic 27): horus_manager::commands::plugin::run_info_unified 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":"horus_manager/src/commands/plugin.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"059b81f6bb22a86acedb3fd68c9d5ad55f0807d03dccb0a9725e2245c3672da6"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::extract_rust_file (cyclomatic 26): horus_manager::commands::doc_extract_rust::extract_rust_file has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fbd589d202f5570042e77e6e22af19d16c14bc24807d4bfe55b9c8e4a91c45"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::pkg::run_remove (cyclomatic 26): horus_manager::commands::pkg::run_remove has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"678850929974d84901a2767e59adfca76e0277f39d4c3d829f545a8bcb9d58d8"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::execute_run (cyclomatic 26): horus_manager::commands::run::execute_run has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21544d3c45887e3194ae83e98b40e76af4726afb08a362e7320fdd67881d512"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::finalize_config (cyclomatic 25): Scheduler::finalize_config 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2a82188f2e185edda97716131064d44453f5771f3842cc5f3f26c64ac854ea"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::check_safety_monitors (cyclomatic 25): Scheduler::check_safety_monitors 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4213}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bef03fd9d3260d2ff0439abbedbb8cc68d9926d9d163fca0ebb19e11fac774"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::process_tick_result (cyclomatic 25): Scheduler::process_tick_result 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5683}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5506425c21f68fd4517a6df443a2d63f3f24efbb7a85a61736577de69a2002"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient::install_from_cratesio (cyclomatic 25): RegistryClient::install_from_cratesio 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea63d07a1ee4ae46ce369c5cf503a6444782a2a26b225563ef040f18f63a12cb"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::deps::split_dependencies_with_context (cyclomatic 25): horus_manager::commands::run::deps::split_dependencies_with_context 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":"horus_manager/src/commands/run/deps.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5384766376438dacd56340d2592bee57c495ec1721f0a42285593b9ffffdbb"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_sys::discover::find_topics (cyclomatic 25): horus_sys::discover::find_topics 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":"horus_sys/src/discover/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fa2aaaba37a57428423ffa1ad08383c17cd82a2aef0a25e57a761f798e17f5"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeParams::validate_value (cyclomatic 24): RuntimeParams::validate_value 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":"horus_core/src/params.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b39cbef15d83200ec20a5d8b6cc46d4fad6c3685bd7c0a9af0e2def0911e94"}},{"ruleId":"D1","level":"warning","message":{"text":"AsyncExecutor::async_thread_main (cyclomatic 24): AsyncExecutor::async_thread_main 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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c69fd56cf9c8987e2f91abcc2ba8ad201fb93729ded3123d10178b1cd45c16"}},{"ruleId":"D1","level":"warning","message":{"text":"RtReport::generate (cyclomatic 24): RtReport::generate has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_report.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d12df2c8989f45a54eaaa794dfa39dcd2530893bd02ee9e9237e6503bf3b34"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_core::communication::topic::header::read_slot_from_region (cyclomatic 24): horus_core::communication::topic::header::read_slot_from_region 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":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ed0f0d84fb4cb37aef6a4169de4cda5a324d25a982db24200c6af084dc373b"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::msg::parse_messages_from_source (cyclomatic 24): horus_manager::commands::msg::parse_messages_from_source 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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf342a3ac34f1e58668ebc175529a3588ad929433eb95f2f0bf035e045b110a"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::registry::helpers::add_features_to_cargo_toml (cyclomatic 24): horus_manager::registry::helpers::add_features_to_cargo_toml 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0029b0be922603847d41c32e6546be1ad818d761fdb1dedf54a34dcb6657c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"RtConfig::apply (cyclomatic 23): RtConfig::apply 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":"horus_core/src/core/rt_config.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0254af19bf2647e3c1d8b65fad3d269e04f88b54e06bd29cff9283807c1f8d00"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::execute_single_tick (cyclomatic 23): Scheduler::execute_single_tick 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"d930b59a1fcaf116c54b9e1183f0e1ad68a26f83e4567562310b0eb44177c0e7"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient::install_from_pypi (cyclomatic 23): RegistryClient::install_from_pypi 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6b0759edf895b70db5c4f2863cadec74508489309c6aa318204a28f348c27e"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::execute_multiple_files (cyclomatic 23): horus_manager::commands::run::execute_multiple_files 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":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b23533acac17de0b73c232a39bb17bf7f6481c3b7ecaa130a86e453b2c49308"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::run_cpp::build_cpp (cyclomatic 23): horus_manager::commands::run::run_cpp::build_cpp 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":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b523cc315bd5f0192e23921394472e875d0e916fe34322f54baecd5125a797ae"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::tf::tune_static_frame (cyclomatic 23): horus_manager::commands::tf::tune_static_frame 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":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9732f7ee514938fd4aea0d26158d943ca9b7847e9c2e386751b29b7d9f25733"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient::apply_driver_requirements (cyclomatic 22): RegistryClient::apply_driver_requirements has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"465ae0735435e6085c0b9d43894db5d5516e7550bb9fff0be0e683025273de68"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::new::create_new_project_with_options (cyclomatic 22): horus_manager::commands::new::create_new_project_with_options 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":"horus_manager/src/commands/new.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"35accdcf526e2aac3379368ec503d28fa1d70b26c7c7fe547277fd2d4d04ccc3"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::node::node_info (cyclomatic 22): horus_manager::commands::node::node_info has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/node.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0ad3de4d7991941fe126aa320b8670fd3442aeb35b088a3402260d65c58e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::lockfile::installed_packages (cyclomatic 22): horus_manager::lockfile::installed_packages has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/lockfile.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5eb50d77a510bf3dd25a1899fa1a43a64bfc219b3ed25bac663e18741ac022"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::registry::helpers::precompile_package (cyclomatic 22): horus_manager::registry::helpers::precompile_package has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e6c9cff77468d348e50e748f875c1ff7d8fb417ffdffc9f27c93a880a066ad"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_core::communication::write_topic_slot_bytes (cyclomatic 21): horus_core::communication::write_topic_slot_bytes 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":"horus_core/src/communication/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1c6afc32945d0ec4c7856a401bacf95372889e4babffd0c7ebd7aef830b00c"}},{"ruleId":"D1","level":"warning","message":{"text":"HorusManifest::validate_issues (cyclomatic 21): HorusManifest::validate_issues 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":"horus_manager/src/manifest.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"977cf1067dad2010da0ba92b98d4db787343befedca1b70d0cc654f1e5981819"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::clean::clean_shared_memory (cyclomatic 21): horus_manager::commands::clean::clean_shared_memory 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":"horus_manager/src/commands/clean.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cf2ddafc061704ee5c3417763aadb56ec8619f3ebf3783855bf8db05d59d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doc_extract_cpp::walk_node (cyclomatic 21): horus_manager::commands::doc_extract_cpp::walk_node 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":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"95efaee97fa1d12ce6029a82032eba2e81d5e4ee2eeb9e311f8a9683f26c8a0a"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::msg::generate_messages (cyclomatic 21): horus_manager::commands::msg::generate_messages 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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"0702178de6a05fa285a1b2a7413b3ba39c1d89645af6f3d774a377b31baefe56"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::run_rust::execute_with_scheduler (cyclomatic 21): horus_manager::commands::run::run_rust::execute_with_scheduler 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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1592ff6234bc9116867ca670fb8bb3cf52222b4b14d6c6aa48209a023b5b74"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadyDispatch::run (cyclomatic 20): ReadyDispatch::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/dispatch.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20a8f8702b0d180efa1cfc4ac25b8256b11800ad6926a165f7f4161d1305ab4"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::advance_tick (cyclomatic 20): Scheduler::advance_tick 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4632}}}],"partialFingerprints":{"codehealthFindingId/v1":"563188ad0106ea0af5e6f9aadc82ec303da2a571efc55f68c999bb77d61f7be9"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeDef::parse (cyclomatic 20): NodeDef::parse 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":"horus_macros/src/node.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed23d37f74812b5ebb3b8572074cef306cfc9d76faee2e5865a970415f7d15e8"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_macros::node::impl_node_macro (cyclomatic 20): horus_macros::node::impl_node_macro 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":"horus_macros/src/node.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"d470848d0247286dab9f05fe5e3bb0dac899b89b9ba7b634cc8828ed7519d841"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::pkg::detect_plugin_metadata (cyclomatic 20): horus_manager::commands::pkg::detect_plugin_metadata 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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6499a7b73c3c04cd81ca26c44871431d0364c50d41d6d62dfbc212d21337c9"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::pkg::run_add (cyclomatic 20): horus_manager::commands::pkg::run_add 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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb423e2f24ef93c4e1a89ca15e1c118d2effb618512cdff11e407fd2c8100d9"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::tf::calibrate_from_points (cyclomatic 20): horus_manager::commands::tf::calibrate_from_points has cyclomatic complexity 20 (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":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff915d6890fb14b7c1e505d728df53757344fa517d41e934b4927986983d8cd2"}},{"ruleId":"D1","level":"warning","message":{"text":"Replicator::process_packet (cyclomatic 20): Replicator::process_packet 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":"horus_net/src/replicator.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f7b558653a208699225c01666edf4cc8cec4cd69ac1726a99c4d8f4eea6278"}},{"ruleId":"D1","level":"warning","message":{"text":"PyTopic::recv (cyclomatic 20): PyTopic::recv has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: PyTopic::backend_type (cyclomatic 81) 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":"horus_py/src/topic.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f97f165d61c2b1339403d782ae5d05e2afd55ce6265c228cde788d0350e2fef"}},{"ruleId":"D1","level":"warning","message":{"text":"generator._generate_rust_code (cyclomatic 20): generator._generate_rust_code 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":"horus_py/horus/msggen/generator.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"976cca2be9d76b1792038d03c873aba9b5e9f69ab800a87cf6cf8651e9a19c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_core::scheduling::primitives::apply_degradation_action (cyclomatic 19): horus_core::scheduling::primitives::apply_degradation_action 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":"horus_core/src/scheduling/primitives.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"413885f5e04799f167337594397bde4753f72715237b62abfe8a1974e66c97ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_message (cyclomatic 19): Parser::parse_message 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":"horus_manager/src/msgspec/parse.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4104cd98b90f8c1dcdaac35b1579005badc5ca39fe4da60809ca40b9a043ae"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginDiscovery::detect_category (cyclomatic 19): PluginDiscovery::detect_category has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/discovery.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a276628e9571a2b2489a0017f4916dcba8c1afa656260b717a8d5c76e7d2acb2"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doctor::check_drivers (cyclomatic 19): horus_manager::commands::doctor::check_drivers 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":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e672a85d213457d1826986e2d2f148c2d804cd00ff4d8db462cfa252c7af181"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::network_env (cyclomatic 19): horus_manager::commands::run::network_env has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46aff10660390ef7c086af38920c4c13097e1fb5e9eb3e8a3fe931ebb744e47"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::install::install_pip_packages (cyclomatic 19): horus_manager::commands::run::install::install_pip_packages 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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7326ae68a12d5da46e18521c24f51b5c72a787bb07d98803af1c8bfbe1a1df"}},{"ruleId":"D1","level":"warning","message":{"text":"Replicator::process_incoming_message (cyclomatic 19): Replicator::process_incoming_message 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":"horus_net/src/replicator.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b333168a89459f145e5530a0af03a398f9224b9d79351b7c377b2fbf9cca53b"}},{"ruleId":"D1","level":"warning","message":{"text":"Replicator::handle_export (cyclomatic 19): Replicator::handle_export 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":"horus_net/src/replicator.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a463805ae4a80f6f0c854ea41bc1f07c69c1afe2edb91b7a0b920dcd468b34"}},{"ruleId":"D1","level":"warning","message":{"text":"AsyncExecutor::process_node_result (cyclomatic 18): AsyncExecutor::process_node_result has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde447a068e7d436f1f3c4becec73e1071405a3def528581ce3c7e13410f74f5"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputeExecutor::process_node_result (cyclomatic 18): ComputeExecutor::process_node_result has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/compute_executor.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a7409bf45e97109ed01fd03921d7a3cb4ac88a4f717a4092bed67117255be3"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_cpp::node_ffi::node_builder_build (cyclomatic 18): horus_cpp::node_ffi::node_builder_build 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":"horus_cpp/src/node_ffi.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a5344732f15b8720a14c812f5f959990abc40dc8de601b83a4b270f824d901"}},{"ruleId":"D1","level":"warning","message":{"text":"RegistryClient::detect_system_python_package (cyclomatic 18): RegistryClient::detect_system_python_package has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfbcc4f747a8869e3e68b668ed160278a2e8c2790c39b6515fda5a12341f935"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doc_extract::cross_reference_pass (cyclomatic 18): horus_manager::commands::doc_extract::cross_reference_pass has cyclomatic complexity 18 (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":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"5710e1ad7b24efe92a5699bcbf30b3b5d2c91c934aadb5f79278d88997bcaef6"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doc_extract_cpp::extract_class_or_struct (cyclomatic 18): horus_manager::commands::doc_extract_cpp::extract_class_or_struct has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a36c325483732f1f23451f6fcaa0a318c6f6786c8bc8bb1153b8e2f749aff4"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::parse_struct_fields_from_tokens (cyclomatic 18): horus_manager::commands::doc_extract_rust::parse_struct_fields_from_tokens has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e204313e63c108f53e88e97726ab1f69c84cff9a9f63d08066b5b85a498aa59e"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::migrate::extract_cmake_deps (cyclomatic 18): horus_manager::commands::migrate::extract_cmake_deps has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/migrate.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae31e4fd3e2526a72fbefbf6e8b51ce05e0a131eb4cc196bea611faf21e0b9cc"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::topic::topic_hz (cyclomatic 18): horus_manager::commands::topic::topic_hz has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8541b55a147e35d0f86e754cfaa69a1fcdc68a38531d28adf3757ce65acc70"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::topic::topic_bw (cyclomatic 18): horus_manager::commands::topic::topic_bw has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7325b9fdc300595adfe7e9e4711d0dea9823726798fb60905db31626bccdd6"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::system_deps::check_dependencies (cyclomatic 18): horus_manager::system_deps::check_dependencies has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/system_deps.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb906e2f3b930bda0c6841dd72823b3f5c64b203ed7ab8170ea5e5f6b1de999"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::system_deps::format_dependency_report (cyclomatic 18): horus_manager::system_deps::format_dependency_report has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/system_deps.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fbf2a17923fbee2ebd44c691a3b5745722f323dcf10bc3806cbe95e4f77612"}},{"ruleId":"D1","level":"warning","message":{"text":"PresenceReceiver::handle_broadcast (cyclomatic 18): PresenceReceiver::handle_broadcast has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/presence.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c329e16e6c23eb896fb20f3ec50523dabbb3a98242478d144c03e8c5eb84b5"}},{"ruleId":"D1","level":"warning","message":{"text":"Replicator::handle_timer (cyclomatic 18): Replicator::handle_timer has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/replicator.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"285e78b9caab1ea8fc5db3e0d5f19822bd03f25729e60fb61287b2f8901e7214"}},{"ruleId":"D1","level":"warning","message":{"text":"TopicHeader::register_role (cyclomatic 17): TopicHeader::register_role 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":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"e511a9800a82ac08d555f2151502e8181761a6fd11b014a35eb94948e5f41157"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::apply_config (cyclomatic 17): Scheduler::apply_config 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"4867180136cf77472b62683c5d5abbd2270e3aa3c76ae7355129c16c049653bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::apply_rt_optimizations (cyclomatic 17): Scheduler::apply_rt_optimizations 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eedfc6a5f971170f594288af27e0b94709636f2d092f0d9afcf0963fb68497b"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_core::scheduling::rt_executor::check_core_collisions (cyclomatic 17): horus_core::scheduling::rt_executor::check_core_collisions 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":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8545c87169bc5e84970d994618581f358b8440eb658d7fa923def81d34097a5b"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::fmt::python_style_args (cyclomatic 17): horus_manager::commands::fmt::python_style_args 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":"horus_manager/src/commands/fmt.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f47180f8e615487662f149c9bf2f5c3728b7118f0879ad38c9f84adb04e42e"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::lint::build_lint_commands (cyclomatic 17): horus_manager::commands::lint::build_lint_commands 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":"horus_manager/src/commands/lint.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0032a7100efb93406d6f4ff9310e8b1478a2ad66ae00e309d0eef0f1e5f793e4"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::run::install::resolve_horus_packages (cyclomatic 17): horus_manager::commands::run::install::resolve_horus_packages 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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71afe7eb5e753e9ae9482f6ff8c3ac4a4f849f6e7fcc00228c6a7608637bfc2"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_sys::discover::macos::get_cmdline (cyclomatic 17): horus_sys::discover::macos::get_cmdline 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":"horus_sys/src/discover/macos.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"615fb5f88b4cd044eb3b383b4f589a334fb77f93b0413c263c8def86206f21a7"}},{"ruleId":"D1","level":"warning","message":{"text":"builder.build_messages (cyclomatic 17): builder.build_messages 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":"horus_py/horus/msggen/builder.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6405eb4accee01411a99ef9b7e5aec80951d09e2e5f907a2d3fd72263bd25a95"}},{"ruleId":"D1","level":"warning","message":{"text":"Extractor._build_function (cyclomatic 17): Extractor._build_function 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":"horus_manager/src/commands/python_extractor.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4836715795d4b6190e1d60229164e552d086ce2f85b8ad7c99036211cfca2a"}},{"ruleId":"D1","level":"warning","message":{"text":"RingTopic::negotiate_shm_header (cyclomatic 16): RingTopic::negotiate_shm_header 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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"633ddc91903fef89ec8b9a41e12fdd171efaf7f3b66c495bcd64895edd04dc4a"}},{"ruleId":"D1","level":"warning","message":{"text":"ShmFanoutRing::validate_meta (cyclomatic 16): ShmFanoutRing::validate_meta 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":"horus_core/src/communication/topic/shm_fanout.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"f428b1e66b9cb48562aa727b094e5b8af81826b078f385c7b043900e9898b3cd"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyGraph::build (cyclomatic 16): DependencyGraph::build 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":"horus_core/src/scheduling/dependency_graph.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e0f047544c5ceea04ac63e1e5a11ad75a74d544922a911879873a1f6a7252b"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::should_tick_node (cyclomatic 16): Scheduler::should_tick_node 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5357}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbe728f48c1259ab0127a296ca44edbb662e44973567dee82b8d382252a8bb2"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_core::communication::topic::dispatch::send_shm_mp_serde (cyclomatic 16): horus_core::communication::topic::dispatch::send_shm_mp_serde 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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"c859b6c4c6b1b3afc50174ec2489e6672f0d451f6052ddd5d0a6de9030afb02e"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_cpp::action_ffi::action_server_process (cyclomatic 16): horus_cpp::action_ffi::action_server_process 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":"horus_cpp/src/action_ffi.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf2a41c7384b8ccc4c43c0d2250b33eb8a8e08aaf4ca3210b6da128ba3a1394"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_type (cyclomatic 16): Parser::parse_type 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":"horus_manager/src/msgspec/parse.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c35b540b183123dda2032402c5bda6b03921221cf892cf1af40bd8feedb450"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::action::send_goal (cyclomatic 16): horus_manager::commands::action::send_goal 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":"horus_manager/src/commands/action.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"789b8d9567997acb7e3cf122f07de7e439f4b0be28b66c1b3d31a3dcd9deacc3"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::cache::run_clean (cyclomatic 16): horus_manager::commands::cache::run_clean 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":"horus_manager/src/commands/cache.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8703477ca889bb06dee8f2237a57a31a4eec8b52f3d1a439ee9812c321b55"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doc_extract::extract_project (cyclomatic 16): horus_manager::commands::doc_extract::extract_project has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca05753a99eb32fda09b5e945b3fa1d5392717e1fd77117d4e49ea1bac439fef"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::doc_extract_html::write_api_reference (cyclomatic 16): horus_manager::commands::doc_extract_html::write_api_reference 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":"horus_manager/src/commands/doc_extract_html.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"881cbb4ec24e0667670afc3f8b086c5c907e95e630023c1fd8f854804751f451"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::log::view_logs (cyclomatic 16): horus_manager::commands::log::view_logs 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":"horus_manager/src/commands/log.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6f58866d5d8797b859d71b252cfcd4baaf0ef9459c95e08468044a8fa60fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::pkg::run_list_json (cyclomatic 16): horus_manager::commands::pkg::run_list_json 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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"95987af2bf07c283b899aab9f45a9a95203748ed4a27e9d005b2afef9ae0bb04"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::tf::record_transforms (cyclomatic 16): horus_manager::commands::tf::record_transforms has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"040659c700a0266e74aacadef03c1eef300b01663621e5625f1d765a0abc3ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::commands::topic::echo_topic (cyclomatic 16): horus_manager::commands::topic::echo_topic 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":"horus_manager/src/commands/topic.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"363c32e567871f638364db78b4d8975f5b61cd56f2f353b915a1cf54f960982c"}},{"ruleId":"D1","level":"warning","message":{"text":"horus_manager::registry::validate_package_name (cyclomatic 16): horus_manager::registry::validate_package_name 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":"horus_manager/src/registry/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b99c080d8396bfa2d6d98a413aee887ae5149f90461f1efb6f6853efbeeb361"}},{"ruleId":"D1","level":"warning","message":{"text":"PyTopic::try_send (cyclomatic 16): PyTopic::try_send has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: PyTopic::backend_type (cyclomatic 81) 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":"horus_py/src/topic.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"852b3d561d60cf68417f1000e892ae63265639724cd4e9142dba8ba7f50a715b"}},{"ruleId":"D1","level":"warning","message":{"text":"Node._parse_topics (cyclomatic 16): Node._parse_topics 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":"horus_py/horus/__init__.py"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"61869276f0c99a7d8e9d74ca33c2c9ac19539f6580e52d8dccbcf96659c2cd1b"}},{"ruleId":"D1","level":"warning","message":{"text":"autopilot_triage.main (cyclomatic 16): autopilot_triage.main 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":".github/scripts/autopilot_triage.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b7624c37de7e0d792fc21c395496abf4ee9b58498155c2d10588dcc1569afd"}},{"ruleId":"D1","level":"warning","message":{"text":"Extractor.visit_ClassDef (cyclomatic 16): Extractor.visit_ClassDef 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":"horus_manager/src/commands/python_extractor.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bc212a22efc641993a4694ab07fa859faa704b0e1ffab72f4600c9943188fe"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::check::check_manifest_file (cognitive 253): horus_manager::commands::check::check_manifest_file has cognitive complexity 253 (threshold 15). Drivers by points: if/else 92 (197 pts), loops 14 (31 pts), match/switch 6 (18 pts), boolean chains 7 (nesting depth added 134). 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":"horus_manager/src/commands/check.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"d213521e1ab84902e8c5662d485a9718aa0451dfd3d04706c43c72ee319195f6"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::run_command (cognitive 240): horus_manager::run_command has cognitive complexity 240 (threshold 15). Drivers by points: if/else 79 (164 pts), match/switch 32 (65 pts), loops 2 (7 pts), boolean chains 4 (nesting depth added 123). 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":"horus_manager/src/main.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6861866dd6d6d6e5610e1a0390855246d57dc08950249b6a3d9ac8583377da7e"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::check::check_workspace (cognitive 218): horus_manager::commands::check::check_workspace has cognitive complexity 218 (threshold 15). Drivers by points: if/else 57 (145 pts), loops 13 (41 pts), match/switch 6 (23 pts), boolean chains 9 (nesting depth added 133). 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":"horus_manager/src/commands/check.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbde6d52af25c5706899a796058b113d95c47eaf36a7d928602731f5b786be7"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::launch::run_launch (cognitive 159): horus_manager::commands::launch::run_launch has cognitive complexity 159 (threshold 15). Drivers by points: if/else 39 (118 pts), loops 12 (22 pts), match/switch 5 (16 pts), boolean chains 3 (nesting depth added 100). 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":"horus_manager/src/commands/launch.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861598b4bf073b106e3fc21beaff748cd0960e0e039ddc4f8ba332af9823823"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::publish (cognitive 156): RegistryClient::publish has cognitive complexity 156 (threshold 15). Drivers by points: if/else 62 (125 pts), loops 7 (20 pts), match/switch 6 (8 pts), boolean chains 3 (nesting depth added 78). 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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"515d6e3ac3b6b95a2190db5e0d9fb36278623b066c4c212d07fc4179db7eb916"}},{"ruleId":"D2","level":"warning","message":{"text":"RtExecutor::tick_node (cognitive 136): RtExecutor::tick_node has cognitive complexity 136 (threshold 15). Drivers by points: if/else 50 (119 pts), match/switch 6 (14 pts), boolean chains 3 (nesting depth added 77). 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":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"407f3cfe5f077909575c11957165f40603b27ef6c09f7a95f2154066d6dc5426"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::discovery::nodes::discover_nodes_uncached (cognitive 107): horus_manager::discovery::nodes::discover_nodes_uncached has cognitive complexity 107 (threshold 15). Drivers by points: if/else 25 (73 pts), loops 9 (19 pts), match/switch 3 (8 pts), boolean chains 7 (nesting depth added 63). 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":"horus_manager/src/discovery/nodes.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"51656259558f4ddd3a08d44487d678ea2ca2992756dce29f022e758665aa7c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"RtExecutor::rt_thread_main (cognitive 101): RtExecutor::rt_thread_main has cognitive complexity 101 (threshold 15). Drivers by points: if/else 32 (75 pts), match/switch 7 (18 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 56). 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":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fe108ac99b55a01a1fdc5d1e8d69cd5c7dc9969134127f314208097edaf672"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::check_timing_violations (cognitive 100): Scheduler::check_timing_violations has cognitive complexity 100 (threshold 15). Drivers by points: if/else 26 (89 pts), match/switch 2 (8 pts), boolean chains 3 (nesting depth added 69). 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5905}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7def72a8482dc447700c439596f2101a6f2f8a04e659f926e3a89b02d7b6f3"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::services::server::run_server_loop (cognitive 94): horus_core::services::server::run_server_loop has cognitive complexity 94 (threshold 15). Drivers by points: if/else 20 (66 pts), match/switch 3 (13 pts), loops 5 (12 pts), boolean chains 3 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/services/server.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a786233aed92e894d9971ff2dfb2f950306421df5af20a28e5c504fb82f380"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::install_from_registry (cognitive 93): RegistryClient::install_from_registry has cognitive complexity 93 (threshold 15). Drivers by points: if/else 46 (78 pts), loops 3 (6 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"99aab0290a7a0a98760c110d49b3bf4fa27f6634b7f73bcd6cdcb82476369c80"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::run_with_filter (cognitive 92): Scheduler::run_with_filter has cognitive complexity 92 (threshold 15). Drivers by points: if/else 32 (59 pts), loops 9 (21 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a61ea6df1610a32c562995124208449e47ace0a64cadf5be5c347a4cae6839"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::run_rust::execute_build_only (cognitive 86): horus_manager::commands::run::run_rust::execute_build_only has cognitive complexity 86 (threshold 15). Drivers by points: if/else 33 (83 pts), match/switch 2 (3 pts) (nesting depth added 51). 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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8521c855489cde8dc3310cbaa40c8c4592b14cb87d1e01a32e75bb7e3ccced7"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::plugin::run_info_unified (cognitive 83): horus_manager::commands::plugin::run_info_unified has cognitive complexity 83 (threshold 15). Drivers by points: if/else 22 (77 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 57). 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":"horus_manager/src/commands/plugin.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9691fa5e0be45f3eaa53e1390b013e6098237096805c712b573639d3d0df287"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::msg::parse_messages_from_source (cognitive 82): horus_manager::commands::msg::parse_messages_from_source has cognitive complexity 82 (threshold 15). Drivers by points: if/else 16 (64 pts), loops 4 (12 pts), boolean chains 6 (nesting depth added 56). 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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bc2e4dfc1cfbf256a12c8f4ccd8d57d910ffe9b0df62106a57498064b2cca2"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_sys::discover::find_topics (cognitive 79): horus_sys::discover::find_topics has cognitive complexity 79 (threshold 15). Drivers by points: if/else 17 (67 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 55). 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":"horus_sys/src/discover/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b1674fc32d5f55da68ee8999edd793172d0f515f0c23fef4ce8b5c0dd3fe8b"}},{"ruleId":"D2","level":"warning","message":{"text":"EventExecutor::watcher_thread (cognitive 78): EventExecutor::watcher_thread has cognitive complexity 78 (threshold 15). Drivers by points: if/else 23 (68 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/event_executor.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a676bcb5593e14e0e56214a7b277f4318198645047613ecb880530c939c4d9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::action::discover_actions (cognitive 77): horus_manager::commands::action::discover_actions has cognitive complexity 77 (threshold 15). Drivers by points: if/else 12 (46 pts), loops 9 (22 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/action.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dadb3ae8858083175160a7ba7e49747b22da82485d1fcb341d1462836cd64f"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::run_list (cognitive 75): horus_manager::commands::pkg::run_list has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (60 pts), loops 5 (13 pts), boolean chains 2 (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"2792987adfdde03e43efb6d70785fe2e2854faca09b4f3a2769454908682bbb5"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::node::list_nodes (cognitive 73): horus_manager::commands::node::list_nodes has cognitive complexity 73 (threshold 15). Drivers by points: if/else 23 (47 pts), loops 5 (15 pts), match/switch 5 (11 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/node.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32dc7bb25056db201469be70be14602c5d43fc562eabd62ff81c92f0e41cb3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::check_safety_monitors (cognitive 71): Scheduler::check_safety_monitors has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (59 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e706195980168013e45c38c14834e5ce48e0d0435a31c740d249fae0f61a382"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputeExecutor::compute_thread_main (cognitive 70): ComputeExecutor::compute_thread_main has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (54 pts), loops 7 (13 pts), boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/compute_executor.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"5206c04d82441f3cad8f1c6ee2ca38d6cfbc42ae68cd1789b8d27f37c4efe9a7"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::update_packages (cognitive 68): RegistryClient::update_packages has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (57 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 40). 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d1a995bd9d147a9965931fb1f955f84c5a390a810236fffa5f745dc9c15c56"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::install_binary_artifact (cognitive 67): RegistryClient::install_binary_artifact has cognitive complexity 67 (threshold 15). Drivers by points: if/else 33 (53 pts), loops 3 (6 pts), boolean chains 4, match/switch 2 (4 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5495feb00f1f269cf41fc555f7b83958b40dc5c4aedcfbb3df57ebf44128fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::tokenize (cognitive 66): Lexer::tokenize has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 7 (18 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/msgspec/parse.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"186fafa66d471ee149979fad24f3593227dca9ec6ed529598ff870b90dfccbd2"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::deps::split_dependencies_with_context (cognitive 64): horus_manager::commands::run::deps::split_dependencies_with_context has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (52 pts), match/switch 3 (9 pts), boolean chains 2, loops 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/deps.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9b0ce723c0e8a27af7a205995bbcb1fa8a1bd46383d2e6f150e1fbcb7b9524"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::record::run_inject (cognitive 63): horus_manager::commands::record::run_inject has cognitive complexity 63 (threshold 15). Drivers by points: if/else 24 (46 pts), match/switch 3 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/record.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"036dac12a73c21d7235a8b17c82921aac2042741b8f9e1cc305e239bee3d2f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::clean::run_clean (cognitive 58): horus_manager::commands::clean::run_clean has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (44 pts), boolean chains 8, loops 2 (6 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":"horus_manager/src/commands/clean.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f3c66ac5dff4fb7a8d3319a4f41cffec85c21623aa94b892eaa47e60b258b2"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::prompt_package_metadata (cognitive 58): horus_manager::registry::helpers::prompt_package_metadata has cognitive complexity 58 (threshold 15). Drivers by points: if/else 28 (51 pts), boolean chains 3, loops 1 (2 pts), 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0819ade1a9f39599c809d515e9eb7e9f108356b8d46818a0485b86b24579f0a6"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::run_rust::execute_with_scheduler (cognitive 57): horus_manager::commands::run::run_rust::execute_with_scheduler has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (56 pts), match/switch 1 (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce1a34856e174a8d2d26d134cf1b3db92842e2050240e19df69d5491ec540ea"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::detect_plugin_metadata (cognitive 56): horus_manager::commands::pkg::detect_plugin_metadata has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (43 pts), match/switch 4 (10 pts), loops 1 (3 pts) (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00be280b73db9bf433378cd07e37897c75a2ce71b4263cd3dd2def2873bb770"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::system_deps::check_dependencies (cognitive 56): horus_manager::system_deps::check_dependencies has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (41 pts), loops 5 (13 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/system_deps.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7ef18cf5c0013d908ff558eb699175ef2fce12236be36776fff11450e1e643"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::parse_struct_fields_from_tokens (cognitive 55): horus_manager::commands::doc_extract_rust::parse_struct_fields_from_tokens has cognitive complexity 55 (threshold 15). Drivers by points: if/else 13 (46 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 38). 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":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"51da7bd01a27322b10ef5fe28deb4ccda6d15826113e33283e6da18c63b82595"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract::format_brief (cognitive 54): horus_manager::commands::doc_extract::format_brief has cognitive complexity 54 (threshold 15). Drivers by points: loops 9 (26 pts), if/else 12 (23 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 30). 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":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"72aa39d6d512685a1a379d4aa42d121bbed7a60bca72136f00e7a60aa3d8f1c1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::add_features_to_cargo_toml (cognitive 54): horus_manager::registry::helpers::add_features_to_cargo_toml has cognitive complexity 54 (threshold 15). Drivers by points: loops 10 (30 pts), if/else 8 (20 pts), match/switch 2 (4 pts) (nesting depth added 34). 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fbd4022e9695853a7b1d3ecd32dbed58465a75d39236700c0397ec755b90b1"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::apply_driver_requirements (cognitive 52): RegistryClient::apply_driver_requirements has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 4 (12 pts), match/switch 2 (5 pts) (nesting depth added 30). 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"468d903ab7248d0ed0a51aade2bbe61714fcd36f3de613470c02b1eecf23feaf"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::execute_run (cognitive 52): horus_manager::commands::run::execute_run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (46 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bce2c582d20228977635169497946fb8acd12a1d1f8c0c63b10cfce3a174a55"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncExecutor::async_thread_main (cognitive 51): AsyncExecutor::async_thread_main has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 8 (15 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5601072bc96e8a9a983f292dc0423d2dd2939648d776b82226e317cd0d3bca"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::run_remove (cognitive 51): horus_manager::commands::pkg::run_remove has cognitive complexity 51 (threshold 15). Drivers by points: if/else 27 (46 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1270015941691ea075dcb508189cc62ced39556d9809106e7356acd9dc9d53"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::precompile_package (cognitive 51): horus_manager::registry::helpers::precompile_package has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 3 (10 pts), boolean chains 6 (nesting depth added 28). 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"18802941743df8dcb7e34646574a1278c7a0546d25cec57c91a51979845e6b80"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::migrate::run_migrate (cognitive 50): horus_manager::commands::migrate::run_migrate has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (38 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/migrate.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa834117c5e015e9c0229ea297755994bb3753e879ee0481df9d7319a4efaf5"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::topic::topic_bw (cognitive 50): horus_manager::commands::topic::topic_bw has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (45 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa73dc58b76d707e4f2f441d86a887a5d4aaf08992a1a419284d45b4a1c4731"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::extract_package_dependencies (cognitive 50): horus_manager::registry::helpers::extract_package_dependencies has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (44 pts), loops 2 (6 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3f9637a58c08ba8669b537e206cbcdfdecc0c032d35bf3d78d0e9d917f23bc"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::install_from_cratesio (cognitive 49): RegistryClient::install_from_cratesio has cognitive complexity 49 (threshold 15). Drivers by points: if/else 27 (43 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"032abb8b5132f9178e452141e59143a672e2e152c5cf481d4f85439468ec76f3"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::lockfile::installed_packages (cognitive 49): horus_manager::lockfile::installed_packages has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 2 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/lockfile.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"019283b0b43abf4c02bcd1031e0c2cea2e42c6765c24b3f88c279d661f593009"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeParams::validate_value (cognitive 47): RuntimeParams::validate_value has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/params.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b43a5265b84b8f18bad1def7b33ce009ac1a020b4bac1a78251ced1bf71289"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::execute_single_tick (cognitive 46): Scheduler::execute_single_tick has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d396cadb0b144135faf0cb43ba24c5d38bca97244a916bd046f5bfca84b0541"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::advance_tick (cognitive 46): Scheduler::advance_tick has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (33 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4632}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ff75f1b4a93f2842f6f58f835ae449476e4e9b50d6471da649370ad21726fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::process_tick_result (cognitive 46): Scheduler::process_tick_result has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 5 (12 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5683}}}],"partialFingerprints":{"codehealthFindingId/v1":"6551f03552f7705bf172bfb32a87ab19c70f1ccd7f893f0571212e980489a6d1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract::cross_reference_pass (cognitive 45): horus_manager::commands::doc_extract::cross_reference_pass has cognitive complexity 45 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 8 (22 pts) (nesting depth added 27). 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":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad872d0e5c25e9c1ad03493f08769d622f067dba6bdee187e927cbe0d05a97d1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::run_add_dep (cognitive 45): horus_manager::commands::pkg::run_add_dep has cognitive complexity 45 (threshold 15). Drivers by points: if/else 26 (32 pts), match/switch 5 (10 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"295c6aba703d2b0d811daccea85be4ccf21ed840ec286a3b4cc8d730392165f9"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::install::resolve_horus_packages (cognitive 45): horus_manager::commands::run::install::resolve_horus_packages has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 25). 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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b861c6253a1642b71bf5b320cc6bc309db139cb45dd60fcf7b7be58f4c5813"}},{"ruleId":"D2","level":"warning","message":{"text":"Replicator::handle_export (cognitive 45): Replicator::handle_export has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 8 (15 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/replicator.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ae8e312aba932fb0912d96fcdd781abebfd81dbe6f74a2696b8dcc910282f6"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::execute_multiple_files (cognitive 44): horus_manager::commands::run::execute_multiple_files has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 9 (17 pts), match/switch 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"580657f67eecf9177ecab196039b13ff556676df9d902c20d3ee5a0f04f904da"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::tf::record_transforms (cognitive 44): horus_manager::commands::tf::record_transforms has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22141753ace229fe3fa8dc24ec928e1767a900bd9f3238e3cde410f1e324fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::extract_deprecated (cognitive 43): horus_manager::commands::doc_extract_rust::extract_deprecated has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (42 pts), loops 1 (nesting depth added 32). 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":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8b09bed655b3ef51fcf1909d78c29586a9d5d949a87e02ab920ff220fbe337"}},{"ruleId":"D2","level":"warning","message":{"text":"RtConfig::apply (cognitive 42): RtConfig::apply has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (34 pts), match/switch 2 (5 pts), boolean chains 3 (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":"horus_core/src/core/rt_config.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a762b9e7e5f2caf7180b76316798746800a95df0fb22cba814cd04532aa44b"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::install::install_pip_packages (cognitive 42): horus_manager::commands::run::install::install_pip_packages has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (35 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba189db0fc011d8ee582566978f04ef0b9aecddbe7cdd8d46e4f90bf119780b"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::topic::topic_hz (cognitive 42): horus_manager::commands::topic::topic_hz has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"287a70f7b34884a34a98290e6cad7908e91004bf80b00c13405f38cc43a51884"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadyDispatch::run (cognitive 41): ReadyDispatch::run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 6 (11 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/dispatch.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aad5e110aae248ed5a7007dcc53d474af43a42408fef3838d1db63f42729b8"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_cpp::walk_node (cognitive 41): horus_manager::commands::doc_extract_cpp::walk_node has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (31 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb35a2a3897a79fbe53a8652acf782544ca000204bb56500d90d389a4ac16cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::run_list_json (cognitive 41): horus_manager::commands::pkg::run_list_json has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 2 (8 pts), boolean chains 3 (nesting depth added 25). 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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfc80a18427e2b9521ccd42a87b2d0ec8d46044b4aced8a9756a41d4209a311"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::finalize_config (cognitive 40): Scheduler::finalize_config has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (36 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ae23d0a1d097003dc1252af88210ba2dfece23304ebd55104f20d3237908fa"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::communication::write_topic_slot_bytes (cognitive 40): horus_core::communication::write_topic_slot_bytes has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 2, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a944b1dc946a4f2b1d51fd82987dcffddbe0ff05bf2b9666ef689785a1aca1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_cpp::extract_class_or_struct (cognitive 40): horus_manager::commands::doc_extract_cpp::extract_class_or_struct has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9b79d775be93433eae89e796b1bd8b6e0a0f725dd805ee9ca36a072e5a0309"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeDef::parse (cognitive 39): NodeDef::parse has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (35 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"152166dea17c2ef7452b4b14e034551887a8633b6549f9358a18759512c25214"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::migrate::extract_cmake_deps (cognitive 39): horus_manager::commands::migrate::extract_cmake_deps has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/migrate.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7e87c9df9dbcd77bce90201848357727c5db3b6fa5c19009410fe3ec2609ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::initialize_filtered_nodes (cognitive 38): Scheduler::initialize_filtered_nodes has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 3 (13 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":3996}}}],"partialFingerprints":{"codehealthFindingId/v1":"5398246663aa4296c60598857a43eca9ec98573c74d98c72a6af6be7dc0f1f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::detect_system_python_package (cognitive 38): RegistryClient::detect_system_python_package has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e16554d886ca6fa67d71f28b992a71dce1fa75e31dd9073aa181a7b7c8f3717"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::run_cpp::build_cpp (cognitive 38): horus_manager::commands::run::run_cpp::build_cpp has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (27 pts), loops 2 (6 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f09a8bc3d7cd69cbd408a1c4bd1540fcfbb8d1669e6485bdbc4c8aa58790e1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::error_wrapper::cargo_error_hint (cognitive 38): horus_manager::error_wrapper::cargo_error_hint has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 13 (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":"horus_manager/src/error_wrapper.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5ef065739584a786fd6f75d70a46ab1a145edea2ca7aba5ee3b9df0fe4f718"}},{"ruleId":"D2","level":"warning","message":{"text":"PyTopic::recv (cognitive 38): PyTopic::recv has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (37 pts), match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/topic.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c443551e78769ef809700c179dd760ea5a77d3c4caf86934d7ace2ed504c19"}},{"ruleId":"D2","level":"warning","message":{"text":"ShmRegion::new (cognitive 38): ShmRegion::new has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/shm/macos.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0076bf32e2e7237f17253fae0a0c7824abe7a1c913a8a0a073adf3e178759d"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::install_from_pypi (cognitive 37): RegistryClient::install_from_pypi has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (31 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3556ebe702b57edd10085bf47679df1da5f33088a3792a0b25220511d97271ed"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::clean::clean_shared_memory (cognitive 37): horus_manager::commands::clean::clean_shared_memory has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 4 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/clean.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"41714f9b091b56c54b494b612b741d091da6da26281f232bbd5c54c084ffb82d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::tf::list_frames (cognitive 37): horus_manager::commands::tf::list_frames has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a303eebc4adc67c736cc61db79dac3a202ccdaabe87da83f5e0680d46f0012"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::communication::topic::header::read_slot_from_region (cognitive 36): horus_core::communication::topic::header::read_slot_from_region has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 8 (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":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f4f0ea43777f39e7c6d3a673774deeb9e365a35fa27f7dfaa4caebbedecb4c"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::cache::run_clean (cognitive 36): horus_manager::commands::cache::run_clean has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 5 (10 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":"horus_manager/src/commands/cache.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f29a4258aab1ca945b0d8129fd46b7158d1677c38fa739789faa72c0a92a91e"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeRegistration::validate (cognitive 35): NodeRegistration::validate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 7, match/switch 3 (5 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":"horus_core/src/scheduling/node_builder.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0942130e5bd3e4cef7d714069e8fbeff02b8abbd7f3cedbadf1d8b2db8199762"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformFrameReader::process_pending_transforms (cognitive 35): TransformFrameReader::process_pending_transforms has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff15315cf93274c8677f5b0bbe5a9ef880bcf84c8585400eff973addf71b5a1"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::get_available_versions (cognitive 35): RegistryClient::get_available_versions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3149b3bf9d069fb710aaf0e84ac50f137d1a04beb670b001d855b235a2b72c"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::run_remove_dep (cognitive 35): horus_manager::commands::pkg::run_remove_dep has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":2498}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f63c2bfad3840af72795b18e265518d913ed8aad2fa80f4173a74b6020a240"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_macros::node::impl_node_macro (cognitive 34): horus_macros::node::impl_node_macro has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (22 pts), loops 6 (12 pts) (nesting depth added 8). 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":"horus_macros/src/node.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eee78ec67b720a101efab36c8b6cc7f58ca59253e7ed8fae612e11a3d54f4c5"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doctor::check_hardware_device (cognitive 34): horus_manager::commands::doctor::check_hardware_device has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a7dd292ee958f451a8f6b0963baed99b7a3aacf0d7e3751301f55b253dd72b"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::msg::list_messages (cognitive 34): horus_manager::commands::msg::list_messages has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (9 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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e956edd555efb4f780bf23c0cc098bf1e386bdad63d9a7e5f3889b3d6cc8a688"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::run_add (cognitive 34): horus_manager::commands::pkg::run_add has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 5 (12 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"038dccfcccf035ac65b03d865982bce706c697251042511b38d7ea91df15c187"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::publish::should_exclude (cognitive 34): horus_manager::registry::publish::should_exclude has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecbc1de9b205046073277ed81e871514b54993ad57bf6be01477fde4ee4ffac"}},{"ruleId":"D2","level":"warning","message":{"text":"RingTopic::check_migration (cognitive 33): RingTopic::check_migration has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (8 pts), match/switch 1 (3 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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"0973b0962040287f4ddcd37c9453d4d206f5bf7cf36e454c111189bb9a831bda"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::action::send_goal (cognitive 33): horus_manager::commands::action::send_goal has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 1 (5 pts), boolean chains 3, 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":"horus_manager/src/commands/action.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"687be869d20b594f1af6fe5c15acc4bdb661c03003ff8c89c8a73cc05e5b309d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract::extract_project (cognitive 33): horus_manager::commands::doc_extract::extract_project has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 4 (19 pts), if/else 4 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12ecf380090b5d340f13ba9383ef280b9220a0ce6425e33618dc41eb62d2fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::proxy::collect_pip_specs (cognitive 33): horus_manager::commands::proxy::collect_pip_specs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b69de318b7e10496272ec2a94cb75723d56c46a02e8bf3def290dd4a006a69"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::tf::monitor_rates (cognitive 33): horus_manager::commands::tf::monitor_rates has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (9 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":"horus_manager/src/commands/tf.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbda6285bf0165d4cba04455441d35a49f954599b886b5221222c2353b649d86"}},{"ruleId":"D2","level":"warning","message":{"text":"NodePresence::read_all (cognitive 32): NodePresence::read_all has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 2 (9 pts), loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/presence.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f813cd4f6cc9ea478c4a1ea86eb119521ab030700d24c2201cc29f35cffd9486"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::node::node_info (cognitive 32): horus_manager::commands::node::node_info has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/node.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5d3882e5348f87b37d7bcd8c51fa7c51111ff6aee76215c3ba03a1a6ab5e19"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::proxy::run_pip_install (cognitive 32): horus_manager::commands::proxy::run_pip_install has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 5, match/switch 1 (5 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c0c9b8b6fb0b6c474f52e82ab20462225299998083e37eb7be6921b19c61ce"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::tf::calibrate_from_points (cognitive 32): horus_manager::commands::tf::calibrate_from_points has cognitive complexity 32 (threshold 15). Drivers by points: loops 13 (22 pts), if/else 6 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb25e7477d9b7192adb3cb3cb0293d9d305d5241a38ab8c11176c07fff175fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::should_tick_node (cognitive 31): Scheduler::should_tick_node has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67762472fba6adecaf01aecafe04bc1c40c0216071e9db02089fbea4859d2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_html::write_api_reference (cognitive 31): horus_manager::commands::doc_extract_html::write_api_reference has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_html.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f7e75bdc5dc9815184416bb478a2f84ddf1e2683159d8e33f8e450f3a8428e"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doctor::check_drivers (cognitive 31): horus_manager::commands::doctor::check_drivers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (7 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c02461e24824be0b574cbbeeae3f0fe2ddd94ad4572b8f09771feeb0e953fc"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::record::run_clean (cognitive 31): horus_manager::commands::record::run_clean has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/record.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd85d03201500b0a3d8a721fa92d4ed0ccbe8f01ac920f81fbd38a190044cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"Replicator::process_packet (cognitive 31): Replicator::process_packet has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 2, match/switch 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":"horus_net/src/replicator.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3391895793aded833491ebda2242642ad16caa4b7d8453f0c7a73658059b0b19"}},{"ruleId":"D2","level":"warning","message":{"text":"Replicator::process_incoming_message (cognitive 31): Replicator::process_incoming_message has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (29 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":"horus_net/src/replicator.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e1a2c7f2fdc016ace45ad24cd971f1e2d33ab27597d5c899b155763fd645c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::execute_nodes (cognitive 30): Scheduler::execute_nodes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 3 (9 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":6328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b435c4bff0e969873019ab25a50e8b6a1e8284f487314174bdc7d86cf7478ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::communication::topic::dispatch::send_fanout_shm (cognitive 30): horus_core::communication::topic::dispatch::send_fanout_shm has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (7 pts), loops 1 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf0586af68146cac77f40e7f46ba3c944128c6372ea9122b1df619a8b8370dd"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::scheduling::rt_executor::check_core_collisions (cognitive 30): horus_core::scheduling::rt_executor::check_core_collisions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f8f281791229a1299894e74bd8509b12b3b8a9eb9966bca9b07fb65e5948f2"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::blackbox::blackbox_tail (cognitive 30): horus_manager::commands::blackbox::blackbox_tail has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (6 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/blackbox.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3229f3715ee1c901a620f9eba99fd94a394eb3761686271f17cd6ca539e5a7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::github_auth::keys_list (cognitive 30): horus_manager::commands::github_auth::keys_list has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 1 (5 pts), match/switch 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"995f57411bb4fef52eaa31d739adf24b93b7340427ce78a66bed2d64384a4094"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::new::create_new_project_with_options (cognitive 30): horus_manager::commands::new::create_new_project_with_options has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (25 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/new.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c60005f303d23f5575b0ec1cfaa976b3593c8d764a861d7d0cef65fe88f7fb7"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::record::run_diff (cognitive 30): horus_manager::commands::record::run_diff has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (6 pts), match/switch 1 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/record.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6541aad487025026e67563b93a5c2221ff6da20d21aec1e311539d715d9ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::pyproject_gen::generate (cognitive 30): horus_manager::pyproject_gen::generate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0916bd95b87f06ea64f4a089baf0a3d7364b29d04102403f2fa0bc3725940d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::pyproject_gen::collect_python_deps (cognitive 30): horus_manager::pyproject_gen::collect_python_deps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"01226f64accf8f84400bd55c8171ba2d2f1e8ad58d35d8e301d3efb751e58e60"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.visit_ClassDef (cognitive 30): Extractor.visit_ClassDef has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 4 (8 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/python_extractor.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df26129859a2d03ea211ea5344b875cabd734c310ac63474c61c99ca500642c"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncExecutor::process_node_result (cognitive 29): AsyncExecutor::process_node_result has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 1, match/switch 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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"960494a4bdfac1d2474340446bad082a9da49bcaf0e405c4f0cacd8976ef444e"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputeExecutor::process_node_result (cognitive 29): ComputeExecutor::process_node_result has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 1, match/switch 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":"horus_core/src/scheduling/compute_executor.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"1877b8353eb521ee401e281b9ea581c2c6bf4176fff7df57887be59fdaf5f826"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyGraph::build (cognitive 29): DependencyGraph::build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 8 (14 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/dependency_graph.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7835f4baefeaae88386f41a788441a87803ae61db1e514ca5d908d3e1ef517d6"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeCapabilities::detect_numa_topology (cognitive 29): RuntimeCapabilities::detect_numa_topology has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 1 (3 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b05cd29c6c2defef020b875732f5eac7fcf7ed219c25ca4af7d3519f0c3624"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::communication::topic::dispatch::send_shm_mp_serde (cognitive 29): horus_core::communication::topic::dispatch::send_shm_mp_serde has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"153aa7a9cac81aebc3ffa3a6195145e3ec4a2ff49fc5997e2b1a89d83af3c120"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::msg::generate_messages (cognitive 29): horus_manager::commands::msg::generate_messages has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 7 (8 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/msg.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6073c396c5c42771aa3166b386a25655a5529ba63317ecfa987c70a51b14b2"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_sys::discover::linux::calculate_cpu_usage (cognitive 29): horus_sys::discover::linux::calculate_cpu_usage has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/linux.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2a52babb8de69c66091a0514c24ca573d42398ec6bb288c054bb2caf171783"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler.run (cognitive 29): Scheduler.run has cognitive complexity 29 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 6 (9 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/horus/__init__.py"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fdade14f82d12b0ccbbdfd9ea2270eb42eb153b3b6f8322d217935ae25fc12"}},{"ruleId":"D2","level":"warning","message":{"text":"ActionServerNode::tick (cognitive 28): ActionServerNode::tick has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2, match/switch 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/server.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9baaa31979718a41ba7560500e00dc5745d78b2373390e20379e23d2363d6a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::apply_rt_optimizations (cognitive 28): Scheduler::apply_rt_optimizations has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (6 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"3853e77ac9739af9bc74f0bcbe2008a0cd71ec5984e5526fed294f38a9ba4933"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::reinit_pending_nodes (cognitive 28): Scheduler::reinit_pending_nodes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4144}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a9e8d9efad500cd996cc75fedcecbacab247980c1c04ddae27ad8d88657c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_cpp::action_ffi::action_server_process (cognitive 28): horus_cpp::action_ffi::action_server_process has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 6 (10 pts), loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/action_ffi.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eda82bba56aea4097cfe3d4a57524ef36c22ce411511314c4c91a6f22a12ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformFrameReader::read_from_shm (cognitive 28): TransformFrameReader::read_from_shm has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6974313ca49487fa4f15dafba39ab2a0dd10f2178ded0df7caecbf3a0ab69555"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_type (cognitive 28): Parser::parse_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (7 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/msgspec/parse.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b673352bc0fd96a261d98353608a706d9a3ae265eaa9d33bc6a194d41c8032c7"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::detect_package_version (cognitive 28): horus_manager::registry::helpers::detect_package_version has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (28 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3510bc920689095aa0004e6b434b643bc8225251ab7da94dbd41edd6e6bc31"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::detect_pypi_installed_version (cognitive 28): horus_manager::registry::helpers::detect_pypi_installed_version has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (26 pts), loops 1 (2 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0180735ee2ccb4f4d4a160a8b1ca69137f2e60805b6b9c88c714127e437bb59"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::system_deps::format_dependency_report (cognitive 28): horus_manager::system_deps::format_dependency_report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/system_deps.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"be19bca4a0a5a469cfa99fc177ea42dbd1d91f38be520050afed54a2d7e2f71d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::deploy::find_cpp_binary (cognitive 27): horus_manager::commands::deploy::find_cpp_binary has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 1 (3 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b143a275cfc53699d311370eb707c4a8213dc7ee072f7b6f1a45f2611244eb"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::install::install_cargo_packages (cognitive 27): horus_manager::commands::run::install::install_cargo_packages has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (6 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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a008733b6976b926ce21e6d1f55f2b8b3ab5f445719daf8139ba35b19b4b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::tf::view_frames (cognitive 27): horus_manager::commands::tf::view_frames has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 5 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e87028375eb24edc7cf112445539b8ff77eb7577a9c5ec7bb8e83ca9db9d83"}},{"ruleId":"D2","level":"warning","message":{"text":"Replicator::handle_timer (cognitive 27): Replicator::handle_timer has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (7 pts), match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/replicator.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ca13df22db6d29375dd0db642ed120640e043f456e4204afc5b42c5b4d96f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_message (cognitive 26): Parser::parse_message has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/msgspec/parse.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87943e7030a83952efa750b753ad9927290ef2104432a8bf256b3cc786ec1e0"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::install_dependencies (cognitive 26): RegistryClient::install_dependencies has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 4 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d7b740bfb6f5fd01838f02bd577cf09e058ebe97d3aa8037ce7d86767f06c0"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::proxy::run_pip_uninstall (cognitive 26): horus_manager::commands::proxy::run_pip_uninstall has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e36846d1c6f72cf9a8743dbd37e69f7423c8001e245bf0120ff2cc1b336bef"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::install::resolve_dependencies_with_context (cognitive 26): horus_manager::commands::run::install::resolve_dependencies_with_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"4328d6235fd34434a02137a97e076f23e9df0840beaf8c4e90204d5486f8b1f2"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::topic::decode_pod_fields (cognitive 26): horus_manager::commands::topic::decode_pod_fields has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b7449d45721114f66a8851b552ff0209bfab677007e57902fb5ab09f7a6c5c"}},{"ruleId":"D2","level":"warning","message":{"text":"TopicHeader::register_role (cognitive 25): TopicHeader::register_role has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53eb5f08eddb331c064596586384a444211bf43368c497b7d69716f4bdfed46"}},{"ruleId":"D2","level":"warning","message":{"text":"RtReport::generate (cognitive 25): RtReport::generate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 4, 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":"horus_core/src/scheduling/rt_report.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4f6f49e8e01e39e98348c7a0434e49894c936f0f00b940fe5c76b55b80ade0"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::node_health_status_lines (cognitive 25): Scheduler::node_health_status_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76c8380fa64d3af6065f8dbf9c7a84d7ae53279dea778105d4f1c5866b7e7f0"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::core::rt_config::get_rt_recommended_cpus (cognitive 25): horus_core::core::rt_config::get_rt_recommended_cpus has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/rt_config.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fa6cb3e785389c1efbf65e9ae550410cd15f547dc03503ebc17703dc65f86f"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::scheduling::primitives::apply_degradation_action (cognitive 25): horus_core::scheduling::primitives::apply_degradation_action has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/primitives.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4afece32ce05a269867aeed19d7910a28f6e027185922922ca048e3384cdb5e"}},{"ruleId":"D2","level":"warning","message":{"text":"HorusManifest::validate_issues (cognitive 25): HorusManifest::validate_issues has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/manifest.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e8d12d2eba7d1da6802e36cad9450b2c6131e759f877c7d6425a6fa0469ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doctor::run_fix (cognitive 25): horus_manager::commands::doctor::run_fix has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b9661a2a3680d3bd2c9038f513f7e9c8f129eb4b9a9464b886aec2a8d11b45"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::features::glob_match (cognitive 25): horus_manager::commands::run::features::glob_match has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/features.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1342b5721d6ce1a1eb9e9615b09c6eea68e71929cf7fbd65e56a29662f00521d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::topic::list_topics (cognitive 25): horus_manager::commands::topic::list_topics has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4867074b4a698e36d241f2a010869fddd1eb5a71530cefb4896ef019297acbe0"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::topic::echo_topic (cognitive 25): horus_manager::commands::topic::echo_topic has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), match/switch 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":"horus_manager/src/commands/topic.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7805278155da996f795c8195f0849fe3ad2a956eec133774662f49d4d3a020b"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::node_detector::detect_python_nodes (cognitive 25): horus_manager::node_detector::detect_python_nodes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (9 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":"horus_manager/src/node_detector.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda0229b07cff56716b720d8d6ddb8bed2c059c74eb9b4080522806673f229c3"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::handle_system_dependencies (cognitive 25): horus_manager::registry::helpers::handle_system_dependencies has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03769070b18c46dedc4a87dfe960d5e4aebf764df67b8429af2e102b407cc30"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::workspace::scan_for_nested_workspaces::scan_recursive (cognitive 25): horus_manager::workspace::scan_for_nested_workspaces::scan_recursive has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/workspace.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38a09d3ecbc3937c038bce0632adba32f18db4081cedb103417a1d77ba26500"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::prepare_node_tick (cognitive 24): Scheduler::prepare_node_tick has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5474}}}],"partialFingerprints":{"codehealthFindingId/v1":"588be4e16763e04b582dc477a5ddce8aafd27b9ddfc62f6e6afe5e5c455fe46f"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::scheduling::record_replay::diff_recordings (cognitive 24): horus_core::scheduling::record_replay::diff_recordings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"855e9bea4f974292e501a4cd69861bf3f4a6d809ce6faf96f05349b03352fbaf"}},{"ruleId":"D2","level":"warning","message":{"text":"DriverConfig::from_manifest (cognitive 24): DriverConfig::from_manifest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (9 pts), 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":"horus_manager/src/commands/run/features.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b577b59ad704c3bacbb485c9e63044d653177cbe4cd5f5e4e30fbc29e35c5f9"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::extract_rust_file (cognitive 24): horus_manager::commands::doc_extract_rust::extract_rust_file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aa5a61966ddfb5213b40e052e388f4dd4955786495af5fc71045907dcbf7a2"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::parse_service_blocks (cognitive 24): horus_manager::commands::doc_extract_rust::parse_service_blocks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (21 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fa7ae0871691050cbe707a94860d7b8470216da218c23938a865368dd9d995"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::proxy::run_with_sync (cognitive 24): horus_manager::commands::proxy::run_with_sync has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"502ce6a44470ba76a7b8bb451fb06307f51f941302f15f195a4ac44227f2a38f"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::proxy::run_conan_proxy (cognitive 24): horus_manager::commands::proxy::run_conan_proxy has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d5c787a8ac51196d1683efb1b8e551dbbe4ca6ee13d2de4118e1f639b7831"}},{"ruleId":"D2","level":"warning","message":{"text":"generator._generate_rust_code (cognitive 24): generator._generate_rust_code has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 6, boolean chains 5, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/horus/msggen/generator.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ab400a073592a33fb7e8694b9852cbcc2f2bc4b6e64741392e306196d65078"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::process_control_commands (cognitive 23): Scheduler::process_control_commands has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6929e92ff8dd53a989683b9bc0eb3f8cf2e954f8ba626744f674be77df91f55"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchSession::read_all (cognitive 23): LaunchSession::read_all has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/launch.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee776b96f4787378cd63fb04baf89f42e55b7b6304f9c70a5e9bd4beee2c4475"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::parse_action_blocks (cognitive 23): horus_manager::commands::doc_extract_rust::parse_action_blocks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (6 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f190d419f2a402bb347c7349182e4ae89d380a607fa94d97e332310df613d03"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::detect_version (cognitive 23): horus_manager::commands::pkg::detect_version has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (23 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"374cdf7f016d51b9dbf2b109ec7fe2835432e29dd65a1845fbe083506cfc8599"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::tf::diff_transforms (cognitive 23): horus_manager::commands::tf::diff_transforms has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e69ccb3bf46c8508ae96fccf1345fa6815ee5d26706fef6ac74d64f2c2f7339"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor.visit_Module (cognitive 23): Extractor.visit_Module has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/python_extractor.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7bf74dad9d889c91722965a56202028124d4919856c8e6d1d5b3670520b8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedLogBuffer::get_since (cognitive 22): SharedLogBuffer::get_since has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/log_buffer.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fba3ddc28632e634dbe144e5d7fd25d2825c0073e708c5fca6ff816ddb2e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"DepthImage::depth_statistics (cognitive 22): DepthImage::depth_statistics has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/depth_image.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a5ada87857ae3b6154a27c196d61de1b61f81e0b353378dadec4c88dc62ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::core::log_buffer::log_drain_loop (cognitive 22): horus_core::core::log_buffer::log_drain_loop has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (7 pts), loops 3 (7 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":"horus_core/src/core/log_buffer.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b0154ef7b668a6b0543e16693307f1a7ed4647e31df0b15010f5655d031bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::get_dependencies (cognitive 22): RegistryClient::get_dependencies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3fee5f31b4c605814426e5d6091b7cb04791da6fc93e23eb10887384180cf7"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::cmake_gen::generate (cognitive 22): horus_manager::cmake_gen::generate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cmake_gen.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"639a9b16b6f8a8164e355b2168a3e0fb15efb91bc8462e0ffd8dd63ebdb8a997"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::lint::build_lint_commands (cognitive 22): horus_manager::commands::lint::build_lint_commands has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/lint.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c96e2247cd28f325240f599fa6faf80c3bb96d0e2f9b359a14943446f39679"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::log::view_logs (cognitive 22): horus_manager::commands::log::view_logs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/log.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f822488dac681d62b375f3b368bec394b7012f8c944bff0fde7b8d279051fe"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::network_env (cognitive 22): horus_manager::commands::run::network_env has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeea937e9d146398b2d799710386f3429af062715678a8dd50c48ba31ce44de"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::install::find_cached_versions (cognitive 22): horus_manager::commands::run::install::find_cached_versions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc580b24b7ff027d63f05d8f1cc0bbee25fef466697c89c04672acc15b783027"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::cli_main (cognitive 22): horus_manager::cli_main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/main.rs"},"region":{"startLine":2328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4623c43847c563aa975a7ab56c75971e090d24aed00380542ef2e0f7ce71fc"}},{"ruleId":"D2","level":"warning","message":{"text":"PresenceReceiver::handle_broadcast (cognitive 22): PresenceReceiver::handle_broadcast has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/presence.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"22107dd9e8ab4b212280defdb24069c89023b5e5ad935e36a3dfca2d04a971db"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_sys::discover::macos::get_cmdline (cognitive 22): horus_sys::discover::macos::get_cmdline has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (5 pts), boolean chains 4 (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":"horus_sys/src/discover/macos.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffb873442e7d20432b97050413399e18e9d6c28f61bb66f565152a08052e954"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor._build_function (cognitive 22): Extractor._build_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 6 (7 pts), loops 3, 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":"horus_manager/src/commands/python_extractor.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e7641210300825b3e1059327bb4980a962227bf38789f30a874b8895cd8c25"}},{"ruleId":"D2","level":"warning","message":{"text":"RingTopic::negotiate_shm_header (cognitive 21): RingTopic::negotiate_shm_header has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, 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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc513b149ca32ac7a4f3d848d6075bd097860ae63d762094f50fad281374465"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordingManager::list_sessions (cognitive 21): RecordingManager::list_sessions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"abecac95ef183a31d0c0bc025996fe22f22448fadd195bef95ee315be55160fb"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoPackage::from_string (cognitive 21): CargoPackage::from_string has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (21 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":"horus_manager/src/commands/run/deps.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7aeef142b3e1f738fa440922df0edfaf3832f987f7bde82dd3ffb72719e3fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_attrs (cognitive 21): Parser::parse_attrs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/msgspec/parse.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51ea3a819f657cfeded70506bde17e4206b4b81edfe041fa4807167e4daee9b"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginDiscovery::discover_local (cognitive 21): PluginDiscovery::discover_local has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/discovery.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"48219d7ac93d6c6612d7cd3d9fdaaf662c7844e34fa57ffbade3628e3d8fa426"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::check::parse_python_imports (cognitive 21): horus_manager::commands::check::parse_python_imports has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/check.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"5512da00824fe465ecb2a8e64b69582bddd47bc09dbdbd4d033a9b643bd9ab6e"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_html::write_nodes_section (cognitive 21): horus_manager::commands::doc_extract_html::write_nodes_section has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (9 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":"horus_manager/src/commands/doc_extract_html.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f6c3d9d8f1b1e2eede48b45ee8754af8039fd3178692fa68730681c65fef67"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::github_auth::whoami (cognitive 21): horus_manager::commands::github_auth::whoami has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"673059b8a08188caadf20ca84ef02f453fa2fd9444531c252c055ec64893c25b"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::verify_plugins (cognitive 21): horus_manager::commands::pkg::verify_plugins has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbd32bb7f0e359395f041520d43e87853f4a40ca5a0bce2d72f56b45982921b"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::record::run_export (cognitive 21): horus_manager::commands::record::run_export has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/record.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0470f29df7b36f338288e7c09a5f7b65f8d146a058415cadfb01090d10816f8"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::validate_package_name (cognitive 21): horus_manager::registry::validate_package_name has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc90ea55a4cc39a679ca0df132bae9397edede497863771c79baad1bc2cea5b"}},{"ruleId":"D2","level":"warning","message":{"text":"Node._parse_topics (cognitive 21): Node._parse_topics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 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":"horus_py/horus/__init__.py"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8823805fc49f13c5f46e0e6e0fef8850e9f5fd4154061ada2d5436f10979ae"}},{"ruleId":"D2","level":"warning","message":{"text":"builder.build_messages (cognitive 21): builder.build_messages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (3 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":"horus_py/horus/msggen/builder.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f46cc6bc6c74442a86cc2bd8c294284b8a6383e7d5b839406f7714fb12ad0e"}},{"ruleId":"D2","level":"warning","message":{"text":"autopilot_triage.main (cognitive 21): autopilot_triage.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 6 (10 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/autopilot_triage.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f7a58cbab4131781000130a2b570d5b2f187465e806361badb357254a086db"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplayDebugger::step_internal (cognitive 20): ReplayDebugger::step_internal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (3 pts) (nesting depth added 12). 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":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9706eeef6e3676b5057ad716d7aae9d3c68a100e85be995cc0c326925789bbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::apply_config (cognitive 20): Scheduler::apply_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0b52e23dc8064a5a50be02c83fa2624a75bb87741635a680686b01be8abdc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::apply_safety_config (cognitive 20): Scheduler::apply_safety_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0570f2dd436d55957e1bdf52de11db74fc07d10df68ba4e5228d59024909117"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::periodic_monitoring (cognitive 20): Scheduler::periodic_monitoring has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4512}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa86e12bd42ececc48f03544614fa08b4a317a19bfdb4f536833bc1d2594ed04"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::shutdown_filtered_nodes (cognitive 20): Scheduler::shutdown_filtered_nodes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4811}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5264e55623cfad9fbc5622a92e29c03bcb013c64bb0155a68ae9f37aca4160"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyResolver::resolve (cognitive 20): DependencyResolver::resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (9 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/dependency_resolver.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b81c8c351d8c8d6dc4b382256701de0213f3048fd3465797cdad2ea341b889a"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_diff::compute_diff (cognitive 20): horus_manager::commands::doc_extract_diff::compute_diff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_diff.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b7ac82b720629c31389f8c92dba80d72f9aadc242a40a866d86df0bcdb9344"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_diff::format_diff_text (cognitive 20): horus_manager::commands::doc_extract_diff::format_diff_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_diff.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9a76ed15d1af558907600313fcada63dd5924461383b0cecb245f93084dcd8"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::extract_service_macro (cognitive 20): horus_manager::commands::doc_extract_rust::extract_service_macro has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 1, loops 1 (nesting depth added 12). 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. This shape REPEATS in the file: one other method here (horus_manager::commands::doc_extract_rust::extract_action_macro) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bce45fed1bc59a5b57bd24c75131599e0f5623c1a399ec73cc47d96f2e9a41e"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::extract_action_macro (cognitive 20): horus_manager::commands::doc_extract_rust::extract_action_macro has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 1, loops 1 (nesting depth added 12). 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. This shape REPEATS in the file: one other method here (horus_manager::commands::doc_extract_rust::extract_service_macro) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4527a4052b8da85a08163cb0709d6bd6e67acb8ef1434c9cfc42269434cf9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doctor::check_rt (cognitive 20): horus_manager::commands::doctor::check_rt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 2, boolean chains 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":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea487280bad1838d395b1d5c3abe12dcff37b152db974f279e2a97f7d51e7a9a"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::msg::linked_message_files_for (cognitive 20): horus_manager::commands::msg::linked_message_files_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/msg.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"99343bc108f8f870bb3829438ee1ddd9a26d927ef9e7638cad1158ca35c1112a"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::msg::discover_messages (cognitive 20): horus_manager::commands::msg::discover_messages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/msg.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4f9e0cca9dbd6649c5c69bc451a19d8f29cae8f7a94609f7ee4ff33e5d6a21"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::param::list_params (cognitive 20): horus_manager::commands::param::list_params has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/param.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55469ddc256088bd9b0ac80d96029b0a96a52861598843b5da1f7d81c336626"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::register_plugin_after_install (cognitive 20): horus_manager::commands::pkg::register_plugin_after_install has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67e94d5e89276a42b8e7629613faa5471ccb334a423d023193dc7e6fdaf49ea"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::proxy::run_vcpkg_proxy (cognitive 20): horus_manager::commands::proxy::run_vcpkg_proxy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea378acb1684fcffd61e22aaa7e98874363f42c0df1fa45a3a68e7801abee034"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::install::unmaterialized_dependencies (cognitive 20): horus_manager::commands::run::install::unmaterialized_dependencies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"00997c629cf1991ac825f73ba5be89a3c92b403ff239cbc3fea53bfeab2d91ff"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::run_rust::find_horus_source_dir (cognitive 20): horus_manager::commands::run::run_rust::find_horus_source_dir has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b832c95a8ce796dd31813bbafd562015aed0ba8f1ac34cc2331c9bfefd677750"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::add_dep_to_pyproject_toml (cognitive 20): horus_manager::registry::helpers::add_dep_to_pyproject_toml has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b0fbb500ecda9c3f04206f3eb825f0d7cbb5d726aafb8e0ee3b53b3e548978"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_net::guard::glob_match (cognitive 20): horus_net::guard::glob_match has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/guard.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"069d7b2e619dce5465d98ed8152849781658259027a79cdec116ba83431c59f1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::drivers::load_from (cognitive 19): horus_core::drivers::load_from has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 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":"horus_core/src/drivers/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"700721ddb36c96be236d97ace16ab2e63affed0e98094fcf6ca8c2bbf2572308"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginDiscovery::detect_category (cognitive 19): PluginDiscovery::detect_category has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/discovery.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13344db02d2e7cd0f4adc61990dd803489ad55c012678f0807f9abf6837c956"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract::build_message_graph (cognitive 19): horus_manager::commands::doc_extract::build_message_graph has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 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":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b125e346579cdefc1c36b8c447e0b31cbb87c12702e00bffaccbfc33997362"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::fmt::python_style_args (cognitive 19): horus_manager::commands::fmt::python_style_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/fmt.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"371f9c98bab02ef6a52ede6592c9bdb95fb81698e3d6fe253ef6710972f43faf"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::proxy::run_cmake_proxy (cognitive 19): horus_manager::commands::proxy::run_cmake_proxy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0e6a9fadb3367c71cd99a5d52b2c99c1f8783e0c9952a8b405a8bfabe5d24a"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::resolve_glob_pattern (cognitive 19): horus_manager::commands::run::resolve_glob_pattern has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 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":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12e0ff8712de4af5186c3021c5098306c572cb2242ce599f879903702028d19"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::service::list_services (cognitive 19): horus_manager::commands::service::list_services has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/service.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d64d5bebadf86c8f2916646514483877060dc43e4d69482b2fb3bce76a28d94"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::tf::replay_transforms (cognitive 19): horus_manager::commands::tf::replay_transforms has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e43a5a1fbd4b281528cf97b2b89a42524c2e5ba9c65efcf6f46338abccf31a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::print_timing_report (cognitive 18): Scheduler::print_timing_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4943}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80846ee69aef8432729d0e40ee6ee669945b5821bbf98e94d318620befa31d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::apply_degradation_action (cognitive 18): Scheduler::apply_degradation_action has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":6116}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fea1c5e77a28b1c3f21f3314db91aa0ae6914ef5c434ce08ca6a2609e6f1df"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::communication::topic::notify_topic_lifecycle (cognitive 18): horus_core::communication::topic::notify_topic_lifecycle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"596efbaefc0403098c126c15d76318a79141af3ad5c9a78c8a6ac771883b7049"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_core::communication::topic::dispatch::recv_shm_pod_broadcast (cognitive 18): horus_core::communication::topic::dispatch::recv_shm_pod_broadcast has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (18 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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a7a442153ad528b92317699fb59c4569f387c6a87c63250285ed5d0bbc6bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"PinContext::load (cognitive 18): PinContext::load has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38ec6cde352286430b71e026a2cc89f30c5c6c4a84781074881f704ca88419a"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencySpec::parse (cognitive 18): DependencySpec::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 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":"horus_manager/src/dependency_resolver.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb82c20d1edb7103e8b88323564a6ff7b5bd897d934586f73e1acd8dd622cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::install_dependency_spec (cognitive 18): RegistryClient::install_dependency_spec has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (8 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cb74002292d1b58f1189e59f1242dc1cf49f4a648230a8608ed98e97692d89"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::deploy::find_python_entry (cognitive 18): horus_manager::commands::deploy::find_python_entry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts) (nesting depth added 11). 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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb7f27000e3279df8704274d97c0c348919ea2973fb432ca10c6cde439a70d2"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc::run_doc (cognitive 18): horus_manager::commands::doc::run_doc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (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":"horus_manager/src/commands/doc.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6560f4aaa05301d627c6b5c12f4cbb62292756eafb1b2a5e0b722c8d2ba1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_diff::detect_breaking_signature_change (cognitive 18): horus_manager::commands::doc_extract_diff::detect_breaking_signature_change has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 3, 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":"horus_manager/src/commands/doc_extract_diff.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce2ebbd468e2785212779588f8cd77b642179263e8abb084e1a398d59b2cef6"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract_rust::extract_message_macro (cognitive 18): horus_manager::commands::doc_extract_rust::extract_message_macro has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c33f5f4400592ddebba2dffb38ebe1150826e5761745996bbff98ed378d39cf"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::pkg::print_package_info (cognitive 18): horus_manager::commands::pkg::print_package_info has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acb6b6cca529c1355194a94be5c9de3f62a784871fdfaf4a9536d853f0fc795"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::proxy::run_cargo_proxy (cognitive 18): horus_manager::commands::proxy::run_cargo_proxy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"514a463a85248a006d02cd772854302a6a2cf4e72f8d96c33464e762de801a44"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::build_child_env (cognitive 18): horus_manager::commands::run::build_child_env has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f1bb7cbc0f8519fb8ed02025ec0eefb22eafc12fa2e736503d8c061579bdd8"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::run_cpp::ensure_system_deps (cognitive 18): horus_manager::commands::run::run_cpp::ensure_system_deps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c73c5d83ae1dd72539f8ec7a8cfd4f66ec71355b0b86d57f03e4d41f29e9a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::service::call_service (cognitive 18): horus_manager::commands::service::call_service has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/service.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"83463677d3e489c91d53a5316e06696ca4abc3128102727dd462a2d75b54542e"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::error_wrapper::preflight_check (cognitive 18): horus_manager::error_wrapper::preflight_check 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":"horus_manager/src/error_wrapper.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"69244e7d7d8032d2db5d4849483ae2f1ca236734d40dcff43c8ae56ee12839b5"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::check_global_version_satisfies (cognitive 18): horus_manager::registry::helpers::check_global_version_satisfies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (3 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7969e99875e25cde2179c053a82b6a33fbcbffdafdf8e312e380905d5d392028"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::system_deps::suggest_system_install (cognitive 18): horus_manager::system_deps::suggest_system_install has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, 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":"horus_manager/src/system_deps.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb4d70869afc27dd45c6fd40f79ba96d40a4c05a267629be528478efb5be660"}},{"ruleId":"D2","level":"warning","message":{"text":"EstopBroadcaster::tick (cognitive 18): EstopBroadcaster::tick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/estop.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"519867dc08dc546e2677ffee7c51241535cb7c1b56a7b2ecc44fd2f7a399317e"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_sys::shm::reap_dir (cognitive 18): horus_sys::shm::reap_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (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":"horus_sys/src/shm/mod.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"8105bec59ad878a1218c3b5ab6890ad499429a884994d827d2a6c2ced4f33f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_sys::shm::cleanup_stale_namespaces_in (cognitive 18): horus_sys::shm::cleanup_stale_namespaces_in has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/shm/mod.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3c0bcbe64ff78cdb5d687afd954903879a474495a4556198dc46815aab9715"}},{"ruleId":"D2","level":"warning","message":{"text":"python_extractor._extract_examples (cognitive 18): python_extractor._extract_examples has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/python_extractor.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fc27382bdb682e5a3e78bbe42462559b0ab0a45dda668c4de71a03339aa217"}},{"ruleId":"D2","level":"warning","message":{"text":"ActionServerNode::admit_goal (cognitive 17): ActionServerNode::admit_goal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/server.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30c50420117f90c247668419e3758836cfbdf9579c7c6dfbaf76ef1c2c10331"}},{"ruleId":"D2","level":"warning","message":{"text":"RingTopic::with_capacity_and_kind (cognitive 17): RingTopic::with_capacity_and_kind has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"f517403c0e4c1ed2663fbe408b444170faa35bdf10c68917d30d2f3598d1b04f"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeRegistration::finalize (cognitive 17): NodeRegistration::finalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4 (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":"horus_core/src/scheduling/node_builder.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4ea4b9248fc19f216b129d4eb121d84d23d2eecac784818f1c0f8d12c87c95"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeRecorder::end_tick (cognitive 17): NodeRecorder::end_tick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d5986343cc52da4b9225ff050d73502e5af8755ff91d0a3d07f04053b33b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::cache::run_info (cognitive 17): horus_manager::commands::cache::run_info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/cache.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"840dfe8e253b8f126d37b0f9d63f9e245ae69dfda7888aae6e299b7cf4a434dd"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::deploy::run_deploy_multi (cognitive 17): horus_manager::commands::deploy::run_deploy_multi has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 2 (4 pts), loops 2, boolean chains 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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c6b6bdda33a38ca95693dd3af286d67b5aeaf67035d2219f08f5aaf4ee3198"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::deploy::build_for_target_rust (cognitive 17): horus_manager::commands::deploy::build_for_target_rust has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8cf84f0e0c8460ade19767f507a364059b991301a6c395bd883006741b67fe"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::launch::print_launch_plan (cognitive 17): horus_manager::commands::launch::print_launch_plan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/launch.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d759f8f3c2ff77c4eaf64ddf6f4f009bcd6bc9d44e9898a66761d23e09d8a6"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::log::follow_logs (cognitive 17): horus_manager::commands::log::follow_logs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/log.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca688ce6eef1da5c03786cc7a16713875cb754d6204784c12ef2876fc1829335"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::registry::helpers::copy_dir_all_inner (cognitive 17): horus_manager::registry::helpers::copy_dir_all_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"423edb8d22b7a26719f102ab0e5b386d40956089cc7ff3f91741bf834a89555d"}},{"ruleId":"D2","level":"warning","message":{"text":"Reassembler::feed (cognitive 17): Reassembler::feed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/fragment.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f54ceb850a8de7f7fb5f74e3e9f14184caa7804e6ba9a4b2bfc267b138a8d08"}},{"ruleId":"D2","level":"warning","message":{"text":"Replicator::run (cognitive 17): Replicator::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 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":"horus_net/src/replicator.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65da684f0601dc90c2ae5aff2d8e80145439c02772eeef52d5bc2e9016f2119"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_net::discovery::find_matches (cognitive 17): horus_net::discovery::find_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 5, 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":"horus_net/src/discovery.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"249c754c35bc9911861cb1cc2cbb55dd3783bc26c6b5f90fbcc6db01566dabfc"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_py::tensor::parse_shape_args (cognitive 17): horus_py::tensor::parse_shape_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/tensor.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9e05ec88dbe5d25d639816b4c6a75f685a139ea39cf4f658588e386247c365"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericMessage::log_summary (cognitive 17): GenericMessage::log_summary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 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":"horus_types/src/generic.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb10280465693d95cbcf88e92fc3f18edfc2d1f8c1a03f95c3d32ffd5c78dd47"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.send (cognitive 17): Node.send has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/horus/__init__.py"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"7211e00671f42f30f3434296fe3eea318c469923178571643fe7e85ea6df3ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"TopicHeader::reap_dead_participants_now (cognitive 16): TopicHeader::reap_dead_participants_now has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d6a0080c662e264e9d36d13fb7e968dc4fb7b82e0ead19e12e67f9f6a33bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"RingTopic::ensure_role (cognitive 16): RingTopic::ensure_role has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d28e45bedd6a63dd2c91a97bae371d43a45b4c828b3ad8968e7d2ef96124f75"}},{"ruleId":"D2","level":"warning","message":{"text":"RingTopic::send_lossy_retry (cognitive 16): RingTopic::send_lossy_retry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4, boolean chains 2, loops 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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":3176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72058fc646be8fa5499d264ff9f2d55a30819e643eca61fb1d0c703f61ec422"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_cpp::service_ffi::service_server_process (cognitive 16): horus_cpp::service_ffi::service_server_process has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (5 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":"horus_cpp/src/service_ffi.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"0957b86bdef51b9c5720ffa3bcf4d9e27eead0caae33c2f7270c99d740898f74"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_cpp_macros::cpp_gen::generate_method_decl (cognitive 16): horus_cpp_macros::cpp_gen::generate_method_decl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 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":"horus_cpp_macros/src/cpp_gen.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fd53ca7148aad97afcd4378951028248081986b65a4e1732b7cfad751db33d"}},{"ruleId":"D2","level":"warning","message":{"text":"RegistryClient::query_driver_features (cognitive 16): RegistryClient::query_driver_features has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (4 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b265b121a0f3e607c05364fbc46126d50d618f9b632289dc160011d1bd842cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::check::run_check_full (cognitive 16): horus_manager::commands::check::run_check_full has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/check.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"16867851857ad64f8349a65a01b65b725c401fbbe3e6a159c75ac0ad215aaac3"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::clean::find_pycache_dirs (cognitive 16): horus_manager::commands::clean::find_pycache_dirs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/clean.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"123b215c6e8e5dc550a3864a85b85548b037fa1feb617900588aa9fb247c153e"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::doc_extract::run_extract_watch (cognitive 16): horus_manager::commands::doc_extract::run_extract_watch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0899185984c5ea24c8f8fdde4db73c29952bf299f00a821131d076f695a269"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::github_auth::wait_for_oauth_callback (cognitive 16): horus_manager::commands::github_auth::wait_for_oauth_callback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"956c8e5df7e922b24e578d6dfa4fd9486abc8fbfa904dbdb789c49f813d20bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::run_cpp::ensure_horus_cpp (cognitive 16): horus_manager::commands::run::run_cpp::ensure_horus_cpp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), 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":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a03f950b34ec610c2f94b3d2aeac9f95a426ac9d6a5f5de24eeb3fcf9d2d5"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::run::run_cpp::find_cpp_binary (cognitive 16): horus_manager::commands::run::run_cpp::find_cpp_binary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, 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":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4789896b69738f0ae0b07491fb05115a98a54f054bc12025cce4cdfb51e5a1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::tf::can_transform (cognitive 16): horus_manager::commands::tf::can_transform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dc56e6eccd7ec2a0115d0108a198f85a1856272048c4653de0a0cdaa6dc6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::topic::classify_message (cognitive 16): horus_manager::commands::topic::classify_message has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca2cbc67d754a9af96482753d7ad14fce2ff20a443e725ed9ceb0f7aec0325d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::commands::upgrade::list_installed_plugins (cognitive 16): horus_manager::commands::upgrade::list_installed_plugins has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/upgrade.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"36241ed7d7ef28027bfc2e7c16766d8eb1ecd5e4e28a87705dab3f71411d2858"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_manager::node_detector::detect_rust_nodes (cognitive 16): horus_manager::node_detector::detect_rust_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/node_detector.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3268dfae7bb7562f3d4ec7a51ea82272c9498899b97fd0b149d267dfdd30fed2"}},{"ruleId":"D2","level":"warning","message":{"text":"ShmRingWriter::open_path (cognitive 16): ShmRingWriter::open_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/shm_writer.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8349933901da306a813551f53ca4a892084134bfdea4f5487845d4b57014ef3d"}},{"ruleId":"D2","level":"warning","message":{"text":"horus_net::log_replication::handle_remote_logs (cognitive 16): horus_net::log_replication::handle_remote_logs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/log_replication.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc551be469775f16e8a603c645d22122af9c9e844049fda627da626189cc4691"}},{"ruleId":"D2","level":"warning","message":{"text":"PyTopic::send (cognitive 16): PyTopic::send has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/topic.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fb898cd54737b338cc03e0f75e6fa45b76b7527490eaac2f13428a26759aee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/messages.rs: FileTooLong \u2014 5455 significant 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 4955 over it, 10.91\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":"horus_py/src/messages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f5713ac374377dd749815d95a80527695d90554a7cf5f8e8ba17857e7e304b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::run_command: FunctionTooLong \u2014 horus_manager::run_command runs 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 765 over it, 8.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/main.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad38e7605f615631ea7ef35a248d3cba330932caca1e5ed4c1146b20a70fbeea"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scheduler: ClassTooLong \u2014 2794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 112 methods, 3 blocks, lines 350-6550. The bar is 400 significant lines; this is 2394 over it, 6.99\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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"626434c5038feb04988c31223d7c407f3cf516ad7dfb3faf0cae21b745fe59be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scheduler/mod.rs: FileTooLong \u2014 2974 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: Scheduler (3 blocks, 350-6550). The bar is 500 significant lines; this is 2474 over it, 5.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04626b520c0072d7fc772084277183d47621f0a7504cc44da19cc9d243d483d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 2028 significant 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 1528 over it, 4.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8444fe360da03eab63d875681440d7f67d964a4f988f451b13329672f253c4ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryClient.publish: MethodTooLong \u2014 publish runs 399 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 299 over it, 3.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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31470fcf1e8aed6cb081921a2e099314c8089d2f890ba0c5e42e162e9045e63"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scheduler: TooManyMethods \u2014 112 methods, declared across 2 files: scheduler/mod.rs (100), scheduler/recording.rs (12). The bar is 30 methods; this is 82 over it, 3.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5556e76b8739339dadbc5f632ce45801fc2fa65fe71527a7eeb9d393512a60e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: topic/mod.rs: FileTooLong \u2014 1808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: RingTopic (5 blocks, 789-3942). The bar is 500 significant lines; this is 1308 over it, 3.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa01fdc673722cb35641342dc35bb7716f5335d2dca4589dcc4586314542e24c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::launch::run_launch: FunctionTooLong \u2014 horus_manager::commands::launch::run_launch 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":"horus_manager/src/commands/launch.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"091e5225afca7a6ba961eb0af1ec48d86b296e54dce3a04220da84bd8759476d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/pkg.rs: FileTooLong \u2014 1716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 1216 over it, 3.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bb106213d0fa6bbaae19dc7dc7c7a686b682a5db9384f0161c9b20f704b25b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryClient.install_from_registry: MethodTooLong \u2014 install_from_registry runs 340 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 240 over it, 3.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b66a5ab6340c2e1b03fc46c123cdffa82ff5788c5ba1ea438fc987511820b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/install.rs: FileTooLong \u2014 1658 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: RegistryClient (3 blocks, 148-2588). The bar is 500 significant lines; this is 1158 over it, 3.32\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2170ed88a34fab794d2d6f7384b8cca55a306a439180922806695aa1b3a69ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scheduler.run_with_filter: MethodTooLong \u2014 run_with_filter runs 318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 218 over it, 3.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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"63008ecac287005331c906f3d0395e65184801bf24125d6baa9556306a1981a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/tf.rs: FileTooLong \u2014 1571 significant 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 1071 over it, 3.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1024b04b32c07daa257e60b9f63ff67071e2bdcd4a13a452bd0b4fe04caf2e7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RingTopic: ClassTooLong \u2014 1089 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 5 blocks, lines 789-3942. The bar is 400 significant lines; this is 689 over it, 2.72\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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"4263f67d6ff924ecb0cba376d4ae04ab4133cd09e2af4366946b8b4c21e5a067"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/topic.rs: FileTooLong \u2014 1358 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: PyTopic (2 blocks, 628-2123). The bar is 500 significant lines; this is 858 over it, 2.72\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":"horus_py/src/topic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acf69cfee8947a4303ee36c0e5125ec7d89fb76de8095325cea838191645a32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/helpers.rs: FileTooLong \u2014 1333 significant 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 833 over it, 2.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fcd8722b910d3594cc3c713fa0b8110da653cf49f3c4eaee845cb9585c645c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TensorPool: ClassTooLong \u2014 1041 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 50 methods, 3 blocks, lines 357-2726. The bar is 400 significant lines; this is 641 over it, 2.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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b23b2e1253da739e8a238f49d5b4ea78e7aa2b33651a3bac13929a8fd640331"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/c_api.rs: FileTooLong \u2014 1259 significant 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 124 free functions. The bar is 500 significant lines; this is 759 over it, 2.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47570e4257aeaac28da2b779bca82c0fde7c33c96d00ee32d2d5f7f2dcf5c35c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryClient.install_binary_artifact: MethodTooLong \u2014 install_binary_artifact runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"458fd4432da16f4bb9f07bb1b311973b687fffce74bbce93f6a6f0c11dab7224"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PyTopic.backend_type: MethodTooLong \u2014 backend_type runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/topic.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde0542192affba24666ca45ef521eaa5f377d675f9655928114be53c953bff7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::pkg::run_add_dep: FunctionTooLong \u2014 horus_manager::commands::pkg::run_add_dep runs 242 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e455fa00b10b539c130cd5b16234ad23f9f58da473875a51edabb4e1d447c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PyTopic: ClassTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 628-2123. The bar is 400 significant lines; this is 560 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/topic.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dd69c73696050eb24ca8983c8e6b010ff75328b02a22c3f158a0bd89b902f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/doctor.rs: FileTooLong \u2014 1179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 679 over it, 2.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47bc98e8a5b83dcf955529cb877dbf697568a7df1b21132b7852322436b3e3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: memory/tensor_pool.rs: FileTooLong \u2014 1171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: TensorPool (3 blocks, 357-2726). The bar is 500 significant lines; this is 671 over it, 2.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba646c59e6db6d9a94c5a8fd60676175e7db3cf62cfc5db89feda489fc3fd14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/check.rs: FileTooLong \u2014 1168 significant 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 668 over it, 2.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca637ecc1c9ef48496c7de00802f5d34cb425b0e111aaf783030a179c5f8c553"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run/install.rs: FileTooLong \u2014 1168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 668 over it, 2.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1cb4599785faa8b28557f675883d52440f177049468acc5cdbb81b44b8ccee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::registry::helpers::prompt_package_metadata: FunctionTooLong \u2014 horus_manager::registry::helpers::prompt_package_metadata runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f70c67c6ab6907e5c6b6b4bc4c8dc0c0e5d79ef38760ea0a3f1575bb77a94f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scheduling/record_replay.rs: FileTooLong \u2014 1129 significant 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 629 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d981fcbc7cddfdf74f7379ef789240e7fed82d6c5fca2848149bbf480a0e2d4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RtExecutor.rt_thread_main: MethodTooLong \u2014 rt_thread_main runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcca5aeefb247723022dfe8a6eed26e2b5b9794c8bd76bff7b19615f421469c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RingTopic: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2c3cb0786a2c26738e256ce09a92295bcbae2169948085a7923eead6541a19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RtExecutor.tick_node: MethodTooLong \u2014 tick_node 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":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001515ddb95d4437d9c202cc053f102f8c7fc6cb7f90519eacf1f0c51c81894"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/deploy.rs: FileTooLong \u2014 1043 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 543 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c5cbca35de40c8a4098a8d52ce67ef516eebbee1b9ec249e7a3e6a0a72ff60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: topic/dispatch.rs: FileTooLong \u2014 1034 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 534 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f8d271710d8d584a1b8bb510840cf9afe74babe76cc02861deede08f75f86c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: horus/__init__.py: FileTooLong \u2014 1020 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 520 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/horus/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fd696e4d92119c1a558b27bbe920bd385d507fcad13c63a7469f82003f0005"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::discovery::nodes::discover_nodes_uncached: FunctionTooLong \u2014 horus_manager::discovery::nodes::discover_nodes_uncached runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/discovery/nodes.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9f8d932e0bea74f91b4312f4f7ffd6dd8ae3bdfdeda67e58ef1a64296c0deb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::node::list_nodes: FunctionTooLong \u2014 horus_manager::commands::node::list_nodes runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/node.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1115213d1a10348452082b56283e78e175cd42ee965c583d157d430d2add45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scheduling/rt_executor.rs: FileTooLong \u2014 962 significant 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 462 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75f636574ea61481644bda71b33f4bf441eebafd81e971b55686181655abe68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::run::run_rust::execute_build_only: FunctionTooLong \u2014 horus_manager::commands::run::run_rust::execute_build_only 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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e16957d1bcb04c68403d158fb3ffddb41bc2b795bd2d883c9476979ec35b43"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyTensorHandle: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/tensor.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c346f5a0f9e0ded1c05fabd96c35f45b2ce214005f9994161b9af7e081a1f54e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::cmake_gen::generate: FunctionTooLong \u2014 horus_manager::cmake_gen::generate runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cmake_gen.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce44aae9424e6543f777f018482f48ce3ceda018a69a140dfa582e480987ab02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::error_wrapper::cargo_error_hint: FunctionTooLong \u2014 horus_manager::error_wrapper::cargo_error_hint 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":"horus_manager/src/error_wrapper.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"205a3e1e81dd6e4bb01eabe26785ff8e2bb78c6f3a8fe26797bcdc7b18937092"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: topic/header.rs: FileTooLong \u2014 880 significant 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 380 over it, 1.76\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":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"701b8c4d830001b21df8ff59c1533563ca07d780062a13a052bf57bf8bc711b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::msgspec::emit_python::module: FunctionTooLong \u2014 horus_manager::msgspec::emit_python::module 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":"horus_manager/src/msgspec/emit_python.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"10404590d5170ba218c68ef9eca8c77e38a9623288446e8f12d00f0054f3240a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PyTopic.send: MethodTooLong \u2014 send 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":"horus_py/src/topic.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b790a931c9623c4281fe6a1a0c808fffacff2606edf94b4f4cba67ec7a9c38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::tf::hand_eye_calibration: FunctionTooLong \u2014 horus_manager::commands::tf::hand_eye_calibration runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6a00034bf7394b64cb274390fe382f5e1d018ce019ce688a51f0676d67a69f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::msg::generate_messages: FunctionTooLong \u2014 horus_manager::commands::msg::generate_messages runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/msg.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"f124148818bcabe6ec8c4bc87437e2e9f899ba3adbf57a297f9245d5d978788d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryClient.install_from_cratesio: MethodTooLong \u2014 install_from_cratesio runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c37790fa6a69ef473b7087ea82daa2c0ba5ff4d6217ce825657cfc0a721afb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/manifest.rs: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 347 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/manifest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a6c6b3697c97d0650df474b2a305b6e71738b8324d941357727becc8256981"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::run::execute_multiple_files: FunctionTooLong \u2014 horus_manager::commands::run::execute_multiple_files runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9756188ef60769f8c7c83ef954c9562a16631d9d34c2e677bf8d2262c7ad85f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::topic::decode_pod_fields: FunctionTooLong \u2014 horus_manager::commands::topic::decode_pod_fields runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b549a137e7365ec652ea556a1e625dc7ac3714ba22f4fe66473fd1a1dceafc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run/run_rust.rs: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 344 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28daefef0d4895cd7bf5e8014ecc6230eea9e02f41b0e99bdbf261e85faccabd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/doc_extract.rs: FileTooLong \u2014 839 significant 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 339 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":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0429ce541b87152f5aa87cc668dedb94ac8b73a1cbe6ddff8cd02efb926774"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TensorPool: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b939c1eb04a32db5aea24a79dba71bb96ef229952715c3e73770f1d3b30be79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scheduler.rs: FileTooLong \u2014 833 significant 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 333 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/scheduler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47785536c7f7faef3303999c99108683f813debd734c5769c355f56ce55bbc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/publish.rs: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: RegistryClient (201-1251). The bar is 500 significant lines; this is 329 over it, 1.66\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"289ec62157a36d00410252ce456cba8f8e5575e89e07333a71876446e3ebb7a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::record::run_inject: FunctionTooLong \u2014 horus_manager::commands::record::run_inject runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/record.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d56b0a877c6513bac996b2c588d8309b1a0ecd0104e7a9b62f8776e2f10413"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error_wrapper.rs: FileTooLong \u2014 819 significant 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 319 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/error_wrapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"223f101aa5f61c24584975ba2cf820e0f64c71728ead464d7ac89b78c407d87f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/topic.rs: FileTooLong \u2014 817 significant 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 317 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd725da097f3bf6385aa3e4afdb9c0e497849f3947a68b461112d265a9dd39c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Topic: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":3988}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d1f0220bd69631c7687f32cc2b378a57e97ed77b514ba047c86a8a1722920b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::pkg::run_remove: FunctionTooLong \u2014 horus_manager::commands::pkg::run_remove runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a17e3a72327619717d980ba93dfa0cbfc3bddbeef03af4ef4c0483cba692f09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/launch.rs: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 314 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/launch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7490626a3d310da3fe40e22db6170d95fd5cce76425da60835a12a99dda077c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RtReport.generate: MethodTooLong \u2014 generate runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_report.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"979db337515ab80ad056603f092ae468563fb0f90e6b6d8cdd2121c25fe78ac8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::run::install::probe_system_distributions: FunctionTooLong \u2014 horus_manager::commands::run::install::probe_system_distributions 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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce9336c87443e89ce42409d8677dc5a457520443e95645d2e5d25ebfa5d3f16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/doc_extract_rust.rs: FileTooLong \u2014 766 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 266 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8344a87b23957c7106b5178dbc0d1752a74c942e6152ab62cb9dd576c90c652"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::tf::calibrate_from_points: FunctionTooLong \u2014 horus_manager::commands::tf::calibrate_from_points runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf24d331cf8009a52b08c4dda69c3bbd6de1a268fc611d999ef9ff60774978c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyScheduler: 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":"horus_py/src/scheduler.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0701c6d2b5087e83efe19b08dcec5bfca39526d7a44e81d3ee6a7b4fc6de64"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Replicator: ClassTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 67-1368. The bar is 400 significant lines; this is 200 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/replicator.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf6e82465107f8055418494c90368c83ff791ceedd81579e61012351df72856"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::deploy::run_deploy_multi: FunctionTooLong \u2014 horus_manager::commands::deploy::run_deploy_multi runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"89574e6f305c9558739e49e9f491af2abd124c3ba0e34ff7fb0b8200b4c2c667"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::registry::helpers::detect_package_info: FunctionTooLong \u2014 horus_manager::registry::helpers::detect_package_info 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"9538522ddc817da81276ac80d95e640e2a7cf61d5532b5a34ccfb2f58a4abf68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RegistryClient.install_from_pypi: MethodTooLong \u2014 install_from_pypi runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84de271c31e68377b606e14d56aa78760f77dcca7b836d0bd661bac71698252"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::run::install::install_pip_packages: FunctionTooLong \u2014 horus_manager::commands::run::install::install_pip_packages 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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"288d30380afe3e3ac7193cea8de25f779ff5456b0552560a9c468306eb68047b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::run::run_rust::execute_with_scheduler: FunctionTooLong \u2014 horus_manager::commands::run::run_rust::execute_with_scheduler 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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"48780a7b97a135e71f55da878e346fe076c187f092b41d0558a4543cdaa2e0ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/msg.rs: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 218 over it, 1.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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19462dfd1ebb1a9e45824a0b2e3a5e0963f09e91d34640a1cf87027bc682899f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegistryClient: TooManyMethods \u2014 43 methods, declared across 4 files: registry/install.rs (19), registry/publish.rs (18), registry/mod.rs (5), registry/helpers.rs (1). The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/mod.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0db5fb1571476eb33f4b80f1ddbdd1e98d922037d7a626ce5303fb17c965698"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: actions/server.rs: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: ActionServerNode (4 blocks, 435-1397). The bar is 500 significant lines; this is 213 over it, 1.43\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":"horus_core/src/actions/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c186246badb910f5aa5b6efd3f0fd6894e3cfd10337e7a5ada0e83cde2c66d37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shm/mod.rs: FileTooLong \u2014 706 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 206 over it, 1.41\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":"horus_sys/src/shm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3482c30607e9e3402d3c152a88d24bd1421d85ed6bf325fa3ff2a6f9136fd212"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::tf::list_frames: FunctionTooLong \u2014 horus_manager::commands::tf::list_frames runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c11d29bb7d2f5822710e638bb3c2f2a16ebc5b763d6e19ef0a18716707f347"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OccupancyGrid: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/occupancy_grid.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"584cf6fc329c114026b8ec6edcaa51118372172feaa43a4bbedd0ee9dce5e877"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyTransformFrame: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/transform_frame.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c28fc9c45fce6c0a772b3d7c95371d9378be89e2fb4cbb7f23c08c795b4bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::clean::clean_shared_memory: FunctionTooLong \u2014 horus_manager::commands::clean::clean_shared_memory runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/clean.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45acd4017d4e31f4835b88396d22bdca917975f15da2fe104c3f89bff6a924f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/perception.rs: FileTooLong \u2014 662 significant 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 162 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/perception.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aab44ab118ec0daf66d6b1c4c4da79d767c088fba7b71485586344b14155488"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rt/linux.rs: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 50 free functions. The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/rt/linux.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df20dfc0c47563337a6d2535a42d3e29818bf5d2035d465a72d1141a142a584"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tensor.rs: FileTooLong \u2014 656 significant 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 78% of them inside a single declaration: PyTensorHandle (3 blocks, 174-1221). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/tensor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41dc642dfc05c1d3420b3f0a754dc8a8ed5d724b2319e3bb39175116c85c2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CostMap: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/costmap.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbc428939a72edf60512da1b518ca843f090ce830c3fa014f47307c31cea567"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/record.rs: FileTooLong \u2014 650 significant 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 150 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":"horus_manager/src/commands/record.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6726b1ba7cb952427c431b2d40afe21df9e106981ffd707887d1f8c09510be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::run::run_cpp::build_cpp: FunctionTooLong \u2014 horus_manager::commands::run::run_cpp::build_cpp 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":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6fe6a00d310582919c154ad674c80f6e45c6a2b56b25e9fead0e15e9a7b70a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_macros::node::impl_node_macro: FunctionTooLong \u2014 horus_macros::node::impl_node_macro runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2019f20d7560797bbf07f30eb94b9b4529ced740eb0014825c8ea642fa319c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run/mod.rs: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a739ab28d0f3b7cf872dc4a1b2f159e942178b58be77d0d458c9e29945becc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PyTensorHandle: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 56 methods, 3 blocks, lines 174-1221. The bar is 400 significant lines; this is 109 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/tensor.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1009411804c07e4f4d8955030cdc7c1c06e67222cf20ef66292f4e0b6b8ec2cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/new.rs: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 136 over it, 1.27\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":"horus_manager/src/commands/new.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca0de95c6c485a88b5266e2054cc5e7712305c789fa0359ed782acea8a364ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scheduler: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/horus/__init__.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c14667608a6f09593e63b0ffed0ca7c1600e1c5e0d22c97eff0d4fe002727d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyImage: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/image.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41e1fd512636a9d7d8fa78a4e718040aed2e35660db261ac453d41881230de2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/replicator.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: Replicator (2 blocks, 67-1368). The bar is 500 significant lines; this is 131 over it, 1.26\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":"horus_net/src/replicator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf5ce79bdc66621220a6255a9252feffc076eca5073f2ab148da0f161d20c6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/upgrade.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/upgrade.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0091a91a025a4595803f5f31b71055e6ddff2b67396cdc1ec0fbb179f8f595b7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RtExecutor: ClassTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 3 blocks, lines 1251-2428. The bar is 400 significant lines; this is 101 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b094571f5e9814109aa5404e0cd29d34e134d5a21556fe859c19ba14953574d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scheduling/safety_monitor.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/safety_monitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ad7f15601da627211e823648d5eb6bf558444d440b549ec3df7dd811c90c48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::action::send_goal: FunctionTooLong \u2014 horus_manager::commands::action::send_goal 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":"horus_manager/src/commands/action.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fb4ad0f264e51dd471068893a95ad404b1d88d6aec1e3a069224aefe7692bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::run::install::resolve_horus_packages: FunctionTooLong \u2014 horus_manager::commands::run::install::resolve_horus_packages runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b290d14f45893f2bb256a4330b155e7f610f4bb0a3110eaf6f7990574e5e157"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyImu: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/messages.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2726bf83e1c7b3fb8482c177825539e16fe2b1008d3e6e35cf696f4baa6a9983"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActionServerNode: ClassTooLong \u2014 492 significant 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, 4 blocks, lines 435-1397. The bar is 400 significant lines; this is 92 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/server.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dad8231fd5107c9b5f8ae747146bbffc6c022399b8ed3a700dca0d2f34b012f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/proxy.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 115 over it, 1.23\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":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"959e9e74dadad424a2577535fa811ffe5e2eaa3d1c98cadaa4d07f777095dcaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::doc_extract::format_brief: FunctionTooLong \u2014 horus_manager::commands::doc_extract::format_brief 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":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f04413526becc0a9bc31e6e33d686c81120c87765e35ac035e9fc0d911fd5a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PyTopic.recv: MethodTooLong \u2014 recv 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":"horus_py/src/topic.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"872cb66a2f37075366f02ec8f9b39a515471e8d8233748420829c66421da71e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::pkg::run_list: FunctionTooLong \u2014 horus_manager::commands::pkg::run_list runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"40adba8d00ffd5bd449449e7cf86c50476569369e201ace8258700942bb56cc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeRegistration.validate: MethodTooLong \u2014 validate 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":"horus_core/src/scheduling/node_builder.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c613de1de953507f87103cf3bd1ecac7f7f140175b0e0f4543d48f730adc8bd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::plugins::sandbox::apply_seccomp_filter_x86_64: FunctionTooLong \u2014 horus_manager::plugins::sandbox::apply_seccomp_filter_x86_64 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":"horus_manager/src/plugins/sandbox.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cfd9d819016110b2dcbe1d4b8171f0bed10053cb3bb8bd64ce91bdce7eb1f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Scheduler: TooManyFields \u2014 35 stored fields beside 112 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c9a706a1406d282170344f9a3172d454ad573162584c555837a3bd9a6d2914"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TopicHeader: TooManyFields \u2014 35 stored fields beside 28 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0c9696752f043e289f2421f652e4c5545afb5fe6e081fb220d428117c18cfd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Commands: ClassTooLong \u2014 466 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 66 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/main.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b8ec49c42e4b1620e5c4e7270a1e9fbff34764b0a4429f64e06580a2e97a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::plugin::run_info_unified: FunctionTooLong \u2014 horus_manager::commands::plugin::run_info_unified 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":"horus_manager/src/commands/plugin.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"746c939f8333cb33430c28bf3a3776e3d77040e48e278bb0b31d2c3dc90a9fdc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodePresence: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/presence.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"17103e9f1f45df34240c50f740ffbc585bb95063878070fa28e9b2822d1f1fea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scheduler.check_timing_violations: MethodTooLong \u2014 check_timing_violations runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5905}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ae42e80962419ff4c60ab540184e1947ebb88733f0c7a37b82bef905534eac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_core::services::server::run_server_loop: FunctionTooLong \u2014 horus_core::services::server::run_server_loop runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/services/server.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf886650ae7482102ee78f6e16b896c0b9588fbd62f8ee1dbac3a5d0b0257dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::pkg::run_add: FunctionTooLong \u2014 horus_manager::commands::pkg::run_add runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b6f74b439692f51e7ce15a28aefa3699f8a4be9888fd3612acc10058bb63e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::tf::tune_static_frame: FunctionTooLong \u2014 horus_manager::commands::tf::tune_static_frame runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"7113a7a315c52b418117b05c56b7a36ee94a4f5ef06cb0521b2f33896064b7ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error.rs: FileTooLong \u2014 559 significant 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 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b80924656a64544c2ce6be912a4f4f2338d3d2e77fa2d6135b9234d5f76cf11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::service::call_service: FunctionTooLong \u2014 horus_manager::commands::service::call_service 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":"horus_manager/src/commands/service.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11d14dfdafa9e6a9e25cff64972ad9070db56f3d471ab46dfce53a7f677539c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Replicator: TooManyFields \u2014 33 stored fields beside 16 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/replicator.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd31abb3363fe2a495773a20bfb92f273d26ea6eb395b8b63c04ef68ec281a78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scheduler.advance_tick: MethodTooLong \u2014 advance_tick runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f7a6c44da0d2caac1c370cb745cb73e0763d8d9631c322a2432da0e2adea0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_core::communication::topic::header::read_slot_from_region: FunctionTooLong \u2014 horus_core::communication::topic::header::read_slot_from_region 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":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2e1fbc0f155aae5a5290fcace7fb5adfc6afafc148f7d192f7b43e9db88b26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_core::drivers::load_from: FunctionTooLong \u2014 horus_core::drivers::load_from 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":"horus_core/src/drivers/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4737cb3a0b25aeb52f4e2c8153d0e725708f95eb74c07af76ae25eb32d5174f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::action::discover_actions: FunctionTooLong \u2014 horus_manager::commands::action::discover_actions 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":"horus_manager/src/commands/action.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"278fc2f693cd2986a10421d249fb8923f995657c9507856214b9194cbc37301e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::doctor::check_installation: FunctionTooLong \u2014 horus_manager::commands::doctor::check_installation 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":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd3c300eaacf9fb529f6a609df0c0d46b52bdcb937f4a2000af0c6f63a3bda7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NodeStatus: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/discovery/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3451ef7cb3f51beb986e6d24b14dc532ea382c18c1a4fc370e04c7d6c8d34af8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::topic::topic_hz: FunctionTooLong \u2014 horus_manager::commands::topic::topic_hz runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"622a8647924a5ff7518a0728d07cb5e254d429301b5b349b7023f55362906654"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::registry::helpers::add_features_to_cargo_toml: FunctionTooLong \u2014 horus_manager::registry::helpers::add_features_to_cargo_toml runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"290a012025f38bf713710924ead5eefa28c8986061ae793491c41bfa4bce0a24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventExecutor.watcher_thread: MethodTooLong \u2014 watcher_thread runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/event_executor.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d367cc3aa0bed40cc5ad92a05a734fc403fa97504d7abb211044115cb2ac89b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RtReport.print: MethodTooLong \u2014 print runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_report.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6f9e82ce1332f5fbf78b8f28acfdefc5c086d8ae604750c1191a7af5ccd22e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::tf::record_transforms: FunctionTooLong \u2014 horus_manager::commands::tf::record_transforms runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"4199711782f26e706b447ad9acf92a370da8475cbc02976a29de6f90b0f1763f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::commands::topic::topic_bw: FunctionTooLong \u2014 horus_manager::commands::topic::topic_bw runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf28ee678ac501cbdaa99553e8f7d2fda84660513aeec4017e3b76104dd3e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: horus_manager::registry::helpers::handle_system_dependencies: FunctionTooLong \u2014 horus_manager::registry::helpers::handle_system_dependencies runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e069686af8fc56f2b69f2f804112fdea455877373a04034af03751e4e3c5ff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DepthImage: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/depth_image.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96ce1c173ba748fed0cca419774c4b68356701af2e1afa6513596e526d5e183"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReplayDebugger: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a0328823f3c5604ef224ee463ae8c74a18680d4b6b43ab6e0d88301d33729b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Replicator.handle_timer: MethodTooLong \u2014 handle_timer runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/replicator.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"23df4855d228448ccbd4113b8ff3f1778f4c420af45fe73e9ea7b3a8ebb823ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShmRegion.new: MethodTooLong \u2014 new runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/shm/macos.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0607a17c863f3a4ef4b7d25da1024ca3dae594cbba5b7bf08e7ffc0c26ef5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rt/mod.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/rt/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf00151b2c6e47f7084a0c1337016bf71715d76cb26eee21c70555a7576b664a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (212 shared lines): horus_manager/src/registry/install.rs:404-952 | horus_manager/src/registry/install.rs:964-1339 \u2014 These two members are variants of one another: 212 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb041672e2b8279aeb2018c93e8e87e04ac68f83db5809fdbcee98eb3e24c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (95 shared lines): horus_manager/src/registry/install.rs:1500-1723 | horus_manager/src/registry/install.rs:1730-1994 \u2014 These two members are variants of one another: 95 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f803fb8a8f3a871b28a615f7adc01e0be4efcfd291625205af74cddf1c4b489"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (72 shared lines): horus_core/src/memory/tensor_pool.rs:416-515 | horus_core/src/memory/tensor_pool.rs:719-802 \u2014 These two members are variants of one another: 72 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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"00295567f6241ff94025a9d99de996df17cd14c78d9f8dfea8bbd1f285ed8843"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (66 shared lines): horus_core/src/drivers/mod.rs:152-306 | horus_core/src/drivers/mod.rs:352-446 \u2014 These two members are variants of one another: 66 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":"horus_core/src/drivers/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c261cf2773c62c3c619d5f388047eb7bd13d00702886dafa69f299933c1acd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (64 shared lines): horus_core/src/communication/topic/dispatch.rs:2028-2111 | horus_core/src/communication/topic/dispatch.rs:2446-2536 \u2014 These two members are variants of one another: 64 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd66be5d6d20b3c7e69e0d45772154ee6f58f0a57352f78fad10f483e9ded80"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (16 shared lines): horus_py/src/depth_image.rs:71-126 | horus_py/src/image.rs:115-170 \u2014 These two members are variants of one another: 16 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":"horus_py/src/depth_image.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e070d4ecb90a40bf74098d95ec92792a2085feb8d51c46a845170b633a6849"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): horus_manager/src/commands/deps.rs:105-138 | horus_manager/src/commands/deps.rs:246-312 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deps.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"86da4cf1a3a7a43236ad94f293a2813845054c406932f2c72714641ef950ff73"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): horus_manager/src/commands/action.rs:447-629 | horus_manager/src/commands/blackbox.rs:349-417 | horus_manager/src/commands/launch.rs:375-919 | horus_manager/src/commands/log.rs:292-345 | horus_manager/src/commands/service.rs:361-539 | horus_manager/src/commands/topic.rs:160-304 | horus_manager/src/commands/topic.rs:1006-1158 | horus_manager/src/commands/topic.rs:1163-1316 | horus_manager/src/commands/topic.rs:1324-1418 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/action.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dd52c2e768649a61c2825e04bd08394eaa1cda7a3303d104544f6cdf2fcd04"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): horus_manager/src/commands/action.rs:237-353 | horus_manager/src/commands/msg.rs:39-151 | horus_manager/src/commands/node.rs:64-333 | horus_manager/src/commands/service.rs:120-204 | horus_manager/src/commands/topic.rs:15-129 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/action.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2642b53c617f4a9ccac0266f68b2213ce0f4090c8a1ba3b0b9ab158bdc46289f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): horus_py/src/depth_image.rs:138-175 | horus_py/src/image.rs:210-263 | horus_py/src/pointcloud.rs:103-147 | horus_py/src/tensor.rs:354-416 | horus_py/src/tensor.rs:424-486 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/depth_image.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5017a863ea18ea774cf9ca68642eae8bf2e36320920e15d6c2006a9e40eb4464"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): horus_core/src/scheduling/async_executor.rs:335-443 | horus_core/src/scheduling/compute_executor.rs:798-906 | horus_core/src/scheduling/event_executor.rs:290-572 | horus_core/src/scheduling/rt_executor.rs:1428-1927 \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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"83db3db0ef0673509d706f4674f56ebec111cad2182fab01ea196509f4a7ebf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): horus_manager/src/commands/blackbox.rs:420-464 | horus_manager/src/commands/cache.rs:246-290 | horus_manager/src/commands/deploy.rs:355-568 | horus_manager/src/commands/deploy.rs:1203-1282 \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":"horus_manager/src/commands/blackbox.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36448ec9a4b412f92cde52c255053c5c6a13d327d3a4f126cec16581b3d0852"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): horus_manager/src/commands/upgrade.rs:933-953 | horus_manager/src/source_resolver.rs:912-932 | horus_manager/src/source_resolver.rs:935-954 | horus_manager/src/source_resolver.rs:957-981 \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":"horus_manager/src/commands/upgrade.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2d54850928d7a8b7e020f8b2db42ecd7bbefb9f91a493d11e018dc637e9b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): horus_manager/src/commands/run/run_cpp.rs:407-460 | horus_manager/src/commands/run/run_cpp.rs:530-614 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb38e91073a97ee4faea2197152e9285e6430b533e29237fde867850e803b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): horus_py/src/tensor.rs:251-301 | horus_py/src/tensor.rs:1186-1220 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/tensor.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd35cb3f55569f1fac8d2595945c7d3ed6255391377f2f9f3c63ca85867d7fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): horus_manager/src/commands/run/install.rs:1402-1467 | horus_manager/src/registry/install.rs:2514-2587 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"892d35d0ed17fd37585f8dd52a7d14f62cce69e4a0a5bab35d6dfc038d836a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (84 corresponding lines): horus_core/src/memory/tensor_pool.rs:1947-2032 | horus_core/src/memory/tensor_pool.rs:2042-2125 \u2014 These two members are one piece of code written twice and then edited apart: 84 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"5976022310141a2e5ddaa73a833570b3eb1afde86e68e7a6dca73cdc26885177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): horus_manager/src/commands/proxy.rs:1021-1071 | horus_manager/src/commands/proxy.rs:1089-1138 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfbf8bff5bc00b9dbd651c34118e99985dc074cafffbdc80a0613f1400e567d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): horus_manager/src/commands/action.rs:358-434 | horus_manager/src/commands/service.rs:209-265 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/action.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd70ddedd8e68d8cede13834b1691d451067416c637d11594585c249bfd3c6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): horus_manager/src/commands/doc_extract_rust.rs:144-189 | horus_manager/src/commands/doc_extract_rust.rs:191-235 \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":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5435aea39ed37a1c334053e9d0a34f3f5e3e54cefb345dda19273c63e1746a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): horus_core/src/memory/tensor_pool.rs:1547-1624 | horus_core/src/memory/tensor_pool.rs:1736-1792 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d15be3f50753019a6dc0cb490239b713f1a872677b42e0da5fd26b50f55035a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): horus_manager/src/commands/pkg.rs:399-437 | horus_manager/src/registry/helpers.rs:654-690 \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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df8bfbc81500ed998ed8996c291eb792e35f48bb8a5d64ba218f3e3f51013e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): horus_core/src/actions/client.rs:857-895 | horus_core/src/actions/client.rs:906-955 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/client.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"73631aecef47e76a1d1faf11b71f0cea43389c16b658d0eace173ce7291430eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): horus_core/src/params.rs:265-314 | horus_core/src/params.rs:372-412 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/params.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ba64c59ee7659ab92a7135f2eacea5280c7245f2128889f23a5ccf89d0bb0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): horus_manager/src/commands/doc_extract_rust.rs:345-387 | horus_manager/src/commands/doc_extract_rust.rs:390-427 | horus_manager/src/commands/doc_extract_rust.rs:430-467 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 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":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"905aee79e571561257b285fce80d3f9b3ed7408a106fab5a2247d28389bb0728"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): horus_manager/src/commands/new.rs:556-592 | horus_manager/src/commands/new.rs:595-641 \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":"horus_manager/src/commands/new.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"37222f7ea4d14b2b29503b195a54ddbfa73116b2a06cdceebb17716744b7328e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): horus_net/src/wire.rs:442-474 | horus_net/src/wire.rs:492-527 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/wire.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fde2a4c710fd72450223e286988e737570691f7547eff69fa67862fc55ba0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): horus_core/src/types/action_chunk.rs:398-420 | horus_core/src/types/action_chunk.rs:428-447 \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":"horus_core/src/types/action_chunk.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5250c0b4de0421f17762a882b97063313a79f80ac046881ae9ab254f4646dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): horus_sys/src/shm/fallback.rs:194-248 | horus_sys/src/shm/linux.rs:285-339 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/shm/fallback.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa768320266c460f1c0d3fefc4d4f523f3ab7201cb20ab5db8ed4a72e94ed1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): horus_sys/src/shm/fallback.rs:30-71 | horus_sys/src/shm/linux.rs:48-92 \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":"horus_sys/src/shm/fallback.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa381bf8be34d9c31d8ea9d31a67950af809c323a1791827847c0e68801ac6c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): horus_py/src/transform_frame.rs:760-781 | horus_py/src/transform_frame.rs:788-811 \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":"horus_py/src/transform_frame.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"9509f7ee2c5be5e4a51e9e64c2d2853bccac43118a68400c5b2db261e656f7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): horus_core/src/scheduling/compute_executor.rs:292-340 | horus_core/src/scheduling/scheduler/dispatch.rs:149-193 \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":"horus_core/src/scheduling/compute_executor.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aed8be3f5875965bb3e68831d0a1265742d366aa8538c167f1d27fc0eb45e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): horus_core/src/utils.rs:32-59 | horus_manager/src/manifest_lint.rs:492-514 \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":"horus_core/src/utils.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d96da6ec271c76b1464c9635aa2fa930a9a320edf41a08f2bb8c1847759ae65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): horus_py/src/scheduler.rs:204-253 | horus_py/src/scheduler.rs:364-402 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/scheduler.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"963ab8ebccacb7d7383d228e58567bf14b62d1887b738bca9b5fdba5c529e613"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): horus_cpp_macros/src/cxx_gen.rs:154-191 | horus_cpp_macros/src/cxx_gen.rs:198-233 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp_macros/src/cxx_gen.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c272ec83b00a37619dda6c322171d328b1633712486724a0f83f3ea1a8ce29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): horus_manager/src/commands/doc_extract_rust.rs:544-572 | horus_manager/src/commands/doc_extract_rust.rs:577-607 \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":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b104a60568679c13ebed2223e85d6ac0d7a0220ba43bc7723826fb4d2e23c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): horus_manager/src/commands/deps.rs:59-102 | horus_manager/src/commands/deps.rs:160-194 | horus_manager/src/commands/deps.rs:338-373 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deps.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cccc06cb23441b8fa081f41581d5cb907ac5e41195b221e1de4dbfcf68577c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): horus_sys/src/fs/mod.rs:113-149 | horus_sys/src/fs/mod.rs:152-188 | horus_sys/src/fs/mod.rs:192-229 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/fs/mod.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ea151cc85c87e51aff71cbeff0a2abe69a965d3207bda5af665271c34329e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): horus_cpp/src/c_api.rs:2102-2136 | horus_cpp/src/c_api.rs:2143-2186 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c4e3c923d4367c33530f469bbc7b28ed8cb5699f782f45b38691ab051cb7bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): horus_core/src/core/hlog_rt.rs:186-216 | horus_core/src/scheduling/rt_executor.rs:195-225 \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":"horus_core/src/core/hlog_rt.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bc7fb26dc4aedd9495c85347b488a91e905a60edf9a3b441c8db48daa88ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 36\u002B corresponding lines): horus_manager/src/commands/run/install.rs:1362-1397 | horus_manager/src/commands/run/install.rs:1804-1839 | horus_manager/src/registry/install.rs:2342-2378 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 36 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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5f6ea8fd9ff0c607b2e94a0dcaaf731c7fe8bd1c91ea46dfaeb4f478023631"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): horus_core/src/actions/client.rs:361-397 | horus_core/src/actions/server.rs:1240-1281 \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":"horus_core/src/actions/client.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b59d23d634a7cb8af0596c65c9446e7670fe0263e41367c3daf159f92a3bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): horus_core/src/testing/shm_fault.rs:243-267 | horus_core/src/testing/shm_fault.rs:272-296 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/testing/shm_fault.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf57b4b5f07b3b85e3757a8817e865a8775c532f9d6e7f78403cfa049f6b5c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): horus_manager/src/commands/env.rs:325-349 | horus_manager/src/commands/setup_rt.rs:187-210 \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":"horus_manager/src/commands/env.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"42558b261dd676b9c87ca09b3fb55df7c6ea2064954846187553a15cd52fcfbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): horus_macros/src/node.rs:212-242 | horus_macros/src/node.rs:244-274 | horus_macros/src/node.rs:276-311 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee19e0724d569c7cf92cbae91885a7bf92043540c8d756782cfec9c8a373844"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): horus_core/src/core/hlog.rs:420-465 | horus_core/src/core/hlog.rs:476-508 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/hlog.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbb337e9bbc266988188790434c9207f0ec782a3942dfef96a488d506b5f16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): horus_cpp/src/c_api.rs:1434-1466 | horus_cpp/src/c_api.rs:1547-1568 \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":"horus_cpp/src/c_api.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f970cd28b1ae59adc5749c5189ed37921bdf7271a9b74bd89a5ab21c80a53cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): horus_manager/src/commands/doc_extract_cpp.rs:696-722 | horus_manager/src/commands/doc_extract_rust.rs:1110-1137 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb8caa5dd42b45cc3c6fd6f5e54c60b8efa8daa848c6e3f3ece8518004acf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): horus_core/src/communication/topic/shm_fanout.rs:1030-1056 | horus_core/src/communication/topic/shm_fanout.rs:1092-1115 \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":"horus_core/src/communication/topic/shm_fanout.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db822df9915ae7b59b9015e582690ff467f834f45ed4e618d8445370180937e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): horus_net/src/discovery.rs:170-206 | horus_net/src/wire.rs:69-92 \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":"horus_net/src/discovery.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff597a6d62f8d94f4f88084bffa3de43f6790a4d5f19222b15ef89097ede9cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): horus_core/src/communication/topic/mod.rs:3080-3104 | horus_core/src/communication/topic/mod.rs:3563-3586 \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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"06722e3af60f05b49dfc6793b8210910fcff227f194cbac43f2506f3a4b6f2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): horus_manager/src/dependency_resolver.rs:118-149 | horus_manager/src/dependency_resolver.rs:152-184 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/dependency_resolver.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ddea9575036a545fe57816d0c0ccd37733eb70bc1dd123f0206adf631eb633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): horus_manager/src/commands/fmt.rs:32-59 | horus_manager/src/commands/lint.rs:17-44 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/fmt.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"448a15f5c22be0d69d99eed11d3bffe80557314f510f00676fc053c69cd787b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): horus_manager/src/registry/publish.rs:1062-1088 | horus_manager/src/registry/publish.rs:1189-1210 \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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd48d4eab439075167b349eea49d33d9edafb815fdbddfbbc4e6159c8a68d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): horus_py/src/tensor.rs:1159-1179 | horus_py/src/tensor_convert.rs:13-35 \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":"horus_py/src/tensor.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2854e54e2f79d3f03d11180bff8a790a5b4b78d8733c500028f5ff995bf834e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): horus_sys/src/fs/mod.rs:352-382 | horus_sys/src/shm/mod.rs:413-445 | horus_sys/src/shm/mod.rs:452-480 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/fs/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ccc8ade5b9f3f6581c550e0aba0879b18ef72000db08f6d08429d378116829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): horus_cpp/src/c_api.rs:1474-1491 | horus_cpp/src/c_api.rs:1987-2008 | horus_cpp/src/c_api.rs:2051-2073 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9140aaba670c090eb01ff20426dd66bcc3acdfe527ae180c3e0ec270e6f30a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): horus_core/src/communication/topic/mod.rs:446-463 | horus_core/src/communication/topic/mod.rs:466-483 \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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"62982f93587a519a7c9456e68cfae5743b87f243d6f900d67f568147013c82d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): horus_py/src/scheduler.rs:1187-1203 | horus_py/src/scheduler.rs:1254-1271 \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":"horus_py/src/scheduler.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1f28a249e3c3465e6eff8fb7609e9b11ab050fd8a128197d100094c577b8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): horus_core/src/memory/tensor_handle.rs:227-243 | horus_core/src/memory/tensor_handle.rs:255-271 \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":"horus_core/src/memory/tensor_handle.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e253de216afab28e271f1355a6a612464efd2af25db97c7ef9923eeeec5520fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): horus_core/src/error.rs:1375-1396 | horus_core/src/services/client.rs:225-245 \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":"horus_core/src/error.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc62837d379e92e256054ad4872ffda6a19997be75b3c17cf31725efbaed519a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): horus_manager/src/commands/deps.rs:141-158 | horus_manager/src/commands/deps.rs:315-336 \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":"horus_manager/src/commands/deps.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6d3563be2b99cdc8bc0b00a2d21d15ad424b46c9629ba40b16f17c89179c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): horus_py/src/node.rs:190-214 | horus_py/src/node.rs:217-241 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/node.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac148f784bde85a0a946329fdba2a5cb56b0d77408669abe16b5b0b9eb7ab723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): horus_sys/src/platform/mod.rs:208-228 | horus_sys/src/platform/mod.rs:243-262 | horus_sys/src/platform/mod.rs:268-287 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/platform/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"06658522769d08b56aa0bf001503e57f90e3bc10f712ae9b95ce7f7ab83d5b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): horus_core/src/memory/tensor_pool.rs:1509-1540 | horus_core/src/memory/tensor_pool.rs:1695-1728 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeba112bc31c864de6f73b8c7bcd19404baf8752ded8a9c975edece73a84757"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): horus_core/src/scheduling/scheduler/mod.rs:1066-1087 | horus_core/src/scheduling/scheduler/mod.rs:1968-1991 \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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da02c1b5d95408c2898cfb52df70b6fc8bf393cd5440f56a66a84c8c55a9aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): horus_manager/src/lockfile.rs:226-241 | horus_manager/src/manifest.rs:1400-1412 | horus_manager/src/manifest.rs:1743-1752 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/lockfile.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f5affa47a0cdb5415e70fe3814f527f27990e49fd72c83ad9c0ad34957144a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): horus_manager/src/commands/pkg.rs:2122-2142 | horus_manager/src/commands/pkg.rs:2163-2178 \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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c39b41b707a4ef0f0cc5e27c4edd538c53bbe7994eb6db5b6c14a90e78cfb43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): horus_cpp/src/c_api.rs:119-134 | horus_cpp/src/c_api.rs:239-249 \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":"horus_cpp/src/c_api.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1875344fd8aafc28943f6f62d084062d45dc9df4febbde9815961fb00ef2968"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): horus_sys/src/rt/macos.rs:7-50 | horus_sys/src/rt/windows.rs:7-43 \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":"horus_sys/src/rt/macos.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1386814113ea2abadb0a4424788341e3803aeca2dd4f17c2dca215d4fa63c04f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_core/src/memory/image.rs:129-142 | horus_core/src/memory/image.rs:148-163 \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":"horus_core/src/memory/image.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b44a3939cb1ea08d3070a997d63681a1e500650b3e6127222085f86672f0e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 19\u002B corresponding lines): horus_manager/src/registry/publish.rs:980-1003 | horus_manager/src/registry/publish.rs:1035-1058 | horus_manager/src/registry/publish.rs:1113-1136 | horus_manager/src/registry/publish.rs:1144-1165 | horus_manager/src/registry/publish.rs:1212-1230 | horus_manager/src/registry/publish.rs:1232-1250 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1ae13209974dae7e42d567bdab6a1f9c049c195115d33039755937cc62d752"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_core/src/core/presence.rs:410-423 | horus_core/src/core/presence.rs:431-444 \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":"horus_core/src/core/presence.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a97d78d36badc2510cb5502394c78aed6ad80b8ca1ad44e7eeba7acf041d198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): horus_manager/src/commands/run/features.rs:169-190 | horus_manager/src/commands/run/features.rs:307-327 \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":"horus_manager/src/commands/run/features.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b1951c17c14790fb1d88b339697f8b83a07bfa7e1f31239c1aeee6b9283887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): horus_core/src/communication/topic/mod.rs:4892-4910 | horus_core/src/communication/topic/mod.rs:4959-4977 | horus_core/src/communication/topic/mod.rs:5026-5044 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":4892}}}],"partialFingerprints":{"codehealthFindingId/v1":"923406c5bf9072fff98e5d049516b298a76d204556eb5f8540e7870c80c343cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): horus_core/src/core/hlog_rt.rs:104-116 | horus_core/src/scheduling/blackbox_ring.rs:132-147 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/hlog_rt.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"610502f8247bfe234fc60315df1185e45c39ec2cc109527121307cf4ffa4df1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_core/src/scheduling/rt.rs:188-201 | horus_core/src/scheduling/rt.rs:225-238 \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":"horus_core/src/scheduling/rt.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea56b39abd76cc48b680f7affb0d27c3ef1c9e65e46cc01be74e819caae8c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): horus_manager/src/commands/param.rs:317-326 | horus_manager/src/commands/param.rs:328-343 \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":"horus_manager/src/commands/param.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c5e10c11f74c223a23b1d38171e46e090f5e090335e64d19b8fd2d3a14a83c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): horus_core/src/scheduling/fault_tolerance/failure_policy.rs:188-212 | horus_core/src/scheduling/fault_tolerance/failure_policy.rs:416-439 \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":"horus_core/src/scheduling/fault_tolerance/failure_policy.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac12589c8bbc750897c6370cc5063149e759143a867d4e57890a591d48fbdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): horus_net/src/discovery.rs:159-168 | horus_net/src/wire.rs:59-66 \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":"horus_net/src/discovery.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f085df0f0370868f72ff856fb753d57d7fe58e20fcf65919ee5f403e38d0d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 1\u002B corresponding lines): horus_core/src/memory/depth_image.rs:44-44 | horus_core/src/memory/image.rs:50-50 | horus_core/src/memory/occupancy_grid.rs:45-45 | horus_core/src/memory/pointcloud.rs:50-50 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/depth_image.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc5c2374459fa3af1a7b6772a7a2ddd5953d67ff1aa080305673628119353c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): horus_core/src/scheduling/record_replay.rs:879-893 | horus_core/src/scheduling/record_replay.rs:896-908 \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":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d49b45b5db9381485091c8a485d3b1643804c681cd8d4156d5bd04f68ab85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): horus_core/src/communication/topic/mod.rs:486-498 | horus_core/src/communication/topic/mod.rs:501-513 \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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeeee7175f49e9d01264b58f83042d3e2102b32359c5565682a8580634b2a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): horus_core/src/memory/pointcloud.rs:76-87 | horus_core/src/memory/pointcloud.rs:100-112 | horus_core/src/memory/pointcloud.rs:117-126 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/pointcloud.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a241d8637264d4e9411fd9dd21147bfb99fde44679fa70e4060be570721a6e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_sys/src/sync/cpp.rs:81-92 | horus_sys/src/sync/python.rs:38-52 \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":"horus_sys/src/sync/cpp.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"38315a12e8081728901d2a6498998a6ffcf5aa01ba3ec8321559dc9ea90f18a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): horus_manager/src/commands/node.rs:584-616 | horus_manager/src/commands/node.rs:619-644 | horus_manager/src/commands/node.rs:647-667 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/node.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27b0fd8c17d58173587b09fc5d92dbfa9215d47019357f9b7d17ab2677cd911"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): horus_core/src/communication/topic/header.rs:2150-2167 | horus_core/src/communication/topic/header.rs:2182-2198 \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":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":2150}}}],"partialFingerprints":{"codehealthFindingId/v1":"10493738f67588b70541c2c78794ed420bd8087afa4fe4cefddbdce9ff76aec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): horus_py/src/messages.rs:1951-1963 | horus_py/src/messages.rs:2096-2108 | horus_py/src/messages.rs:2259-2270 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/messages.rs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"0988a64efba0dad4b6c14b63b98dbe6e5049cc3c3e1f0910adc4bce91f258205"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_core/src/actions/client.rs:463-499 | horus_core/src/actions/client.rs:502-515 \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":"horus_core/src/actions/client.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae75b42720cad815c6f0fa8421cb2b97bbe312b9267fd9a1f9a2e8caee2ab4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): horus_sys/src/sync/cpp.rs:64-79 | horus_sys/src/sync/rust.rs:39-54 \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":"horus_sys/src/sync/cpp.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c8f8fe53de2f015a3de3cc3973c84300d30cf7198bf57a3786f96780e91407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): horus_core/src/types/dtype.rs:198-215 | horus_py/src/tensor_convert.rs:38-54 \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":"horus_core/src/types/dtype.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd329b021ed9918ab46439f99cbe308d22efe0e6e02396422f8cc832c38454e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 14\u002B corresponding lines): horus_cpp/src/c_api.rs:1280-1296 | horus_cpp/src/c_api.rs:1304-1317 | horus_cpp/src/c_api.rs:1325-1341 | horus_cpp/src/c_api.rs:1349-1362 | horus_cpp/src/c_api.rs:1370-1386 | horus_cpp/src/c_api.rs:1394-1407 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77e541cc88138fef48eca3107b904b57b76369a5fe1d7a73c2fd012c0839fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_cpp/src/transform_ffi.rs:67-78 | horus_cpp/src/transform_ffi.rs:86-100 \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":"horus_cpp/src/transform_ffi.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee64c18fe952148a6eaa594748e1567bd14a7dbe0596b981af0f28940fba5f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_net/src/wire.rs:352-363 | horus_net/src/wire.rs:379-390 \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":"horus_net/src/wire.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfab57acf524079ca42ae9a765edf8f442bc26d02f7747e7cd714a09b00d67e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_core/src/memory/grid_transform.rs:34-47 | horus_core/src/memory/grid_transform.rs:62-75 \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":"horus_core/src/memory/grid_transform.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78a25b1640aedcc2065685a4c47ece1f1601b3c31aadf92f137a4c1f2cc2684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): horus_cpp/src/c_api.rs:1710-1724 | horus_cpp/src/c_api.rs:1736-1750 \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":"horus_cpp/src/c_api.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa9281ce35e846b2be6dd07c656b97ff48417edeb06edd14a2520ae69cc263f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): horus_core/src/communication/topic/shm_fanout.rs:1005-1021 | horus_core/src/communication/topic/shm_fanout.rs:1064-1084 \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":"horus_core/src/communication/topic/shm_fanout.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6469f69833b5f9de731ce0dce6cf5d278bbb612f30092f60335e8223db55a0db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): horus_manager/src/commands/deploy.rs:95-103 | horus_manager/src/toolchain.rs:26-34 \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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ea8a44771b15d19d86c8ac852933176e69a5193521b1a41e68777a5482a17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): horus_core/src/communication/topic/mod.rs:673-688 | horus_core/src/communication/topic/mod.rs:718-734 \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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66cd46c328dfbda2639f2e52b64261206d6ca366b8436c73b447eab53b31652"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): horus_py/src/scheduler.rs:1118-1127 | horus_py/src/scheduler.rs:1130-1139 | horus_py/src/scheduler.rs:1142-1155 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/scheduler.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"570efdc6a3614fb4f47e2788884e7260be1daee3a9b8fc62800c46cd6effb07f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): horus_py/src/params.rs:51-59 | horus_py/src/params.rs:62-70 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/params.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb34c86d52d1531e55c86ed921237cc53a2392214dfdd1760792dc9cb34265b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): horus_core/src/scheduling/safety_monitor.rs:1040-1055 | horus_core/src/scheduling/safety_monitor.rs:1647-1668 \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":"horus_core/src/scheduling/safety_monitor.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"509eb8916f8d58b4e566345682ae41185a596a6b7d5756c5859d7156f8d959c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): horus_cpp/src/c_api.rs:540-552 | horus_cpp/src/c_api.rs:588-600 | horus_cpp/src/c_api.rs:922-934 | horus_cpp/src/c_api.rs:967-979 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e36766ff8c2e79fc12c92a1065b0d26873daa9e5611cb0d0a0d3e67d9584450"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): horus_core/src/communication/topic/dispatch.rs:1100-1132 | horus_core/src/communication/topic/dispatch.rs:1145-1157 \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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"45092c214245e2359a6aac6291ca093d1dd8cbc3373728a56844e8f436506203"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): horus_core/src/core/rt_config.rs:507-534 | horus_sys/src/rt/mod.rs:1261-1273 \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":"horus_core/src/core/rt_config.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2dd7204af792679845066fd094cdbfa8ea12f75c0160f81725cf8afbf3fc99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): horus_manager/src/discovery/mod.rs:242-259 | horus_manager/src/discovery/mod.rs:261-278 \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":"horus_manager/src/discovery/mod.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e739ae053dc5a94748f405de2b9ded62cea5fdd55cdcc4a4af43eed6172d350"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): horus_py/src/scheduler.rs:501-520 | horus_py/src/scheduler.rs:526-544 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/scheduler.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"732e8689fcca699a5cfa4d7017dcd4e40eaf4ee71d9ef617b875c8374472bccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): horus_py/src/scheduler.rs:1296-1305 | horus_py/src/scheduler.rs:1318-1327 | horus_py/src/scheduler.rs:1330-1339 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/scheduler.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8c89ad8ae98b5fb9044bb90b4fd057756167ccab09ae89fe9bdee0c34dbac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_sys/src/shm/mod.rs:1878-1893 | horus_sys/src/shm/mod.rs:1896-1909 \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":"horus_sys/src/shm/mod.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cd60d1ee95cc2b9d79573195374510e13636e28b061c068d1568b11421ddaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): horus_core/src/types/image_encoding.rs:138-153 | horus_py/src/image.rs:44-58 \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":"horus_core/src/types/image_encoding.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"12be76ae48a865a1915bddb8fa8e3f162fec855f24145d784f95b5bd79fa278e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): horus_cpp/src/c_api.rs:1084-1094 | horus_cpp/src/c_api.rs:1151-1160 | horus_cpp/src/c_api.rs:1208-1217 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3695cbeefdae79a7716f97f6b1339fdbe0df4877a8c8343ef39efcc31749584"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): horus_cpp/src/c_api.rs:1903-1913 | horus_cpp/src/c_api.rs:1920-1930 | horus_cpp/src/c_api.rs:1937-1947 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ba38f394fbd0a100828b723c62be5fa559b4d4df1a5a38e54d6b3aa8e72d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): horus_types/src/diagnostics.rs:58-75 | horus_types/src/diagnostics.rs:142-157 | horus_types/src/diagnostics.rs:234-249 | horus_types/src/diagnostics.rs:433-446 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/diagnostics.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd418d3741cfb6828d30dd9bae31133d15c568c77e6c023c3cc904c7fcd68f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): horus_core/src/communication/mod.rs:144-159 | horus_core/src/communication/topic/header.rs:1631-1645 \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":"horus_core/src/communication/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a748bdbaf10ca979ee488ba8f3e1556a80f685331d26ccc2c6e847950ab489c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_macros/src/node.rs:611-629 | horus_manager/src/msgspec/emit_ffi.rs:26-39 \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":"horus_macros/src/node.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eda05f094f296642b72032556d73096e7afb933b8f281d3a499e1618daabba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): horus_core/src/scheduling/async_executor.rs:54-74 | horus_core/src/scheduling/compute_executor.rs:509-529 \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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bde6671a6319c3520dea0b306b9ea2794fbdd29d0300ab98de2bcecbba1dde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): horus_manager/src/commands/doctor.rs:1805-1817 | horus_manager/src/commands/run/run_python.rs:144-154 \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":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd8f76052f1221b95b3e3223f1dbfdefa4bd228159f6af945c3b0456ba75137"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): horus_core/src/memory/costmap.rs:327-337 | horus_core/src/memory/costmap.rs:350-360 | horus_core/src/memory/occupancy_grid.rs:181-191 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/costmap.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a7f60b6b16656b306dc7f7ee8fc18871c8b03859c7e8ecd9e46c0eb89cd01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): horus_core/src/scheduling/record_replay.rs:507-524 | horus_core/src/scheduling/record_replay.rs:602-616 \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":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6fd9d40d3dcfcb98bb28bead3f4b2fa2d4ba533f71366e6a95730927bbf7e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): horus_core/src/types/costmap_descriptor.rs:91-110 | horus_core/src/types/costmap_descriptor.rs:137-156 \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":"horus_core/src/types/costmap_descriptor.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5dc3ab893debc737896986a27cf5241450206dce78e6852777e7fb348b9928"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_py/src/messages.rs:1463-1474 | horus_py/src/messages.rs:2485-2496 \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":"horus_py/src/messages.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9790a97a487daec1d34ed155a1a8d2d256d5bd82e620f6dae439beb194d2efed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 18\u002B corresponding lines): horus_sys/src/discover/mod.rs:43-61 | horus_sys/src/discover/mod.rs:99-116 | horus_sys/src/process/mod.rs:270-288 | horus_sys/src/rt/mod.rs:686-703 | horus_sys/src/rt/mod.rs:706-723 | horus_sys/src/rt/mod.rs:734-752 | horus_sys/src/rt/mod.rs:759-776 | horus_sys/src/shm/mod.rs:1377-1397 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8567151a706bf893dcd72a95b244d9e37d35431ed52934e997d1c1b3a424bea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): horus_types/src/time.rs:167-179 | horus_types/src/time.rs:493-507 \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":"horus_types/src/time.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c59d8777e5ca3a7e850a69ac16fe1d997b8c1655352b36766d80d1151e09f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_core/src/core/log_buffer.rs:797-814 | horus_core/src/core/log_buffer.rs:820-831 \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":"horus_core/src/core/log_buffer.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef23b9da4871a99c038fa9c1d0fd44d2c20678dd931889c16130a9d3362bf0d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): horus_manager/src/commands/pkg.rs:2218-2225 | horus_manager/src/commands/pkg.rs:2227-2238 \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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"43300f3906f963856bbdd106fa8fba1e08aa341411ff996de82e8821a0e413e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): horus_core/src/scheduling/scheduler/mod.rs:2016-2028 | horus_core/src/scheduling/scheduler/mod.rs:2052-2064 \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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09a061d8625bd48b42211be1f7f453ec20455a77d866c5772aa761d0d19ac15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): horus_py/src/tensor.rs:670-686 | horus_py/src/tensor.rs:692-710 \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":"horus_py/src/tensor.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdddf250387d5a90892d71c326685e3e0b4690d09659dc2b5306346ab66a4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): horus_core/src/error.rs:203-213 | horus_core/src/error.rs:219-229 | horus_core/src/error.rs:235-245 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/error.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"981cc7ef8c8c600a1b96d021bd0cc55922f101d2129d9691c722f76c1a2d0900"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): horus_core/src/scheduling/async_executor.rs:77-109 | horus_core/src/scheduling/compute_executor.rs:532-564 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e2fab869ead690ba5ea2509b90cec43a50e07e08a5220b6ebfdd9552a7197a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): horus_manager/src/plugins/registry.rs:223-229 | horus_manager/src/plugins/trust.rs:93-102 \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":"horus_manager/src/plugins/registry.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e13e083a4d274931526729955d1a241719a6786aeb607a002e45279069c52c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): horus_py/src/tensor.rs:628-642 | horus_py/src/tensor.rs:645-660 | horus_py/src/tensor.rs:761-775 | horus_py/src/tensor.rs:778-791 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/tensor.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c84a1e1f467b1b4c05d3dda8203ea042faaa39442fb438b443152065a1ff78e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): horus_sys/src/shm/fallback.rs:252-281 | horus_sys/src/shm/linux.rs:343-390 \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":"horus_sys/src/shm/fallback.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a69fd84957a601af3f2438834b67c31eb4806ac8674c25619f21aef8fe9d8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): horus_core/src/communication/topic/dispatch.rs:1889-1905 | horus_core/src/communication/topic/dispatch.rs:2623-2647 \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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"4938a29dbd6610554451fad4a4a9b1898fcf15347dcd610bd19b20209457fe2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): horus_manager/src/commands/github_auth.rs:169-178 | horus_net/src/mac.rs:227-237 \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":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69faf893b7d7ab758caa426fd07a868e78d79adf310d70237c61190296a28f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): horus_manager/src/commands/doctor.rs:543-555 | horus_sys/src/fs/mod.rs:258-272 \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":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff75fe080a436e52dd7ec7974315a99dd7ff0807fb18297a72ae88d3ce73cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): horus_py/src/depth_image.rs:187-198 | horus_py/src/image.rs:274-283 \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":"horus_py/src/depth_image.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63ec1ec85c3abb6f59485376f8b8f7ea02ee635b52318c5bbf79914228094f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_types/src/generic.rs:198-209 | horus_types/src/generic.rs:226-237 \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":"horus_types/src/generic.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4106d186ee5de93de212eb4861fae5591dee6b06180d6a420003b5c0079fff82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_core/src/communication/topic/mod.rs:4106-4119 | horus_core/src/communication/topic/mod.rs:4175-4188 \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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"135fb4ade72687d1dc2ef78998eca9504b431e8fac3a59d34dabe221f83c199a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): horus_cpp/src/c_api.rs:1495-1505 | horus_cpp/src/c_api.rs:1887-1896 \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":"horus_cpp/src/c_api.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"906f022f805940885b2216f9bfcc5913a6fc0c0126d358c4e1f1ad3e4b737ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): horus_py/src/image.rs:439-444 | horus_py/src/image.rs:451-456 | horus_py/src/image.rs:463-468 | horus_py/src/image.rs:475-480 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/image.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d21e63bf209fa0a9c28af44c666c47e2d64bd5bb18b54c99e7ea372d66c2399"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): horus_py/src/messages.rs:240-244 | horus_py/src/messages.rs:1582-1586 | horus_py/src/messages.rs:1661-1665 | horus_py/src/messages.rs:1763-1768 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/messages.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce86d28e80ca214514b75c4e2bcd1aa84f759badc6dfd6244b8e00fbd31d8797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): horus_py/src/scheduler.rs:1396-1403 | horus_py/src/scheduler.rs:1411-1418 | horus_py/src/scheduler.rs:1451-1458 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/scheduler.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d3bb0636c1e7160f1b1ca431bfbcce40bcae576ff391df7f5e5832ca1e5bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): horus_core/src/communication/topic/mod.rs:4913-4934 | horus_core/src/communication/topic/mod.rs:4980-5001 | horus_core/src/communication/topic/mod.rs:5047-5068 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":4913}}}],"partialFingerprints":{"codehealthFindingId/v1":"4176bcdfd264c9a4ef2ab976abf50e293c44be76fe04f38f95f4a7ef4620d42c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): horus_manager/src/discovery/nodes.rs:286-291 | horus_manager/src/urdf.rs:91-96 \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":"horus_manager/src/discovery/nodes.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6978d2cdc8c88fb3cf636d761483dc2e8a5825c123b6024cbd78a5b06efe8401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): horus_py/src/messages.rs:7472-7483 | horus_py/src/messages.rs:7883-7894 | horus_py/src/messages.rs:8034-8045 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/messages.rs"},"region":{"startLine":7472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4affdb75be53d43087d9aee6cd4cd53c08e230e86611f22ba8d621238187c079"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): horus_core/src/core/log_buffer.rs:196-205 | horus_core/src/core/log_buffer.rs:209-217 \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":"horus_core/src/core/log_buffer.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"343d42040b607254a13f62a8c801616eba2793ae1f66b5fecde9db5b48a6327e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): horus_manager/src/commands/run/mod.rs:2166-2175 | horus_manager/src/commands/run/run_cpp.rs:476-485 \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":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba3c390e09d5f52fb7b11e9c0f52c73186933b30a18041b59f178160a494cca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): horus_core/src/actions/server.rs:222-230 | horus_core/src/actions/client.rs:265-272 \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":"horus_core/src/actions/server.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a292375d1b2df3ec79d321dffc1a2f66890a2754b9ad2ad87b5f1d58eb988e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): horus_manager/src/plugins/resolver.rs:228-239 | horus_manager/src/plugins/resolver.rs:247-255 \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":"horus_manager/src/plugins/resolver.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e194496138f1ad9df8c2ff52d2191021e29f13030aeddd0f465f9ca018510"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): horus_manager/src/registry/helpers.rs:4-14 | horus_manager/src/registry/helpers.rs:16-26 | horus_manager/src/system_deps.rs:490-500 | horus_manager/src/system_deps.rs:502-512 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"954afef66e11253c8e135630879b9875a307c6a2437c39e167142c8877e131fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): horus_py/src/depth_image.rs:56-67 | horus_py/src/image.rs:95-106 | horus_py/src/pointcloud.rs:30-41 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/depth_image.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"14583d302da785b8ec510be8b99baa925d28adee4e078718fb4fe7f2468ec544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): horus_sys/src/rt/linux.rs:1419-1440 | horus_sys/src/rt/linux.rs:1462-1475 \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":"horus_sys/src/rt/linux.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"39208f0e59793820392704d941f056d3fcbc80a52080d8d12c2ae8444e8c0ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): horus_core/src/types/costmap_descriptor.rs:281-286 | horus_py/src/messages.rs:1285-1290 \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":"horus_core/src/types/costmap_descriptor.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a776845ad8d18a9fc824e69547c47bbd00a3ff479dcd45bf220173d352139c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): horus_sys/src/sync/cpp.rs:7-21 | horus_sys/src/sync/python.rs:7-22 \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":"horus_sys/src/sync/cpp.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9decf3b82b1c277d45e554e444cacc1f003b8c1574ae3626e3eb1b3212dbd75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): horus_manager/src/commands/run/run_cpp.rs:847-855 | horus_manager/src/dispatch.rs:630-638 \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":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec68771bd1bee89c8d910ade1b890b0a3b434e37413e0fe2d8a8978d0cbb13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): horus_manager/src/fingerprint.rs:43-51 | horus_manager/src/plugins/registry.rs:272-281 \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":"horus_manager/src/fingerprint.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1de35478232e464d0e1bffc7cc1c60283f634f90aff022dfda731443ac43f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_core/src/actions/server.rs:1382-1396 | horus_cpp/src/action_ffi.rs:571-582 \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":"horus_core/src/actions/server.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc087597fd79b8e07b4fd2954bc92511df99d90ca7b64137e5b4874827cfc7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): horus_core/src/types/costmap_descriptor.rs:275-278 | horus_types/src/time.rs:182-185 \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":"horus_core/src/types/costmap_descriptor.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c04f07ecccd7735386339c1b9bd8642786eb3d44111040284ee7e4f2ba39a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): horus_py/src/messages.rs:7443-7451 | horus_types/src/diagnostics.rs:195-198 \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":"horus_py/src/messages.rs"},"region":{"startLine":7443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c812ede9ac906f95c5792ab2a25abb4c8a9ee37ba8eb40a330072ae3465cbe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): horus_core/src/core/hlog.rs:252-260 | horus_core/src/core/tick_context.rs:236-244 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/hlog.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b189ac0b6584d4969024b02f7549db08c538974065a92b226701b7acebb9495b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): horus_core/src/memory/image.rs:244-250 | horus_core/src/memory/occupancy_grid.rs:314-320 \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":"horus_core/src/memory/image.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"282248aa28fd2d8693f4db246d67c5c3f2bdf2fbcf99f7a1d613fa5297213d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): horus_sys/src/discover/linux.rs:9-12 | horus_sys/src/discover/macos.rs:9-12 | horus_sys/src/discover/windows.rs:9-12 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/linux.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb8ae58acbfdf388b02ef193c036d63ddd2713b505af4e7c12329f0f93bb905"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_sys/src/sync/python.rs:25-36 | horus_sys/src/sync/rust.rs:25-37 \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":"horus_sys/src/sync/python.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1a497dd1809bffea077ef3b40c38c69c9f8ed01a2af57240c959d80319c722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): horus_core/src/communication/topic/header.rs:2238-2248 | horus_types/src/generic.rs:259-268 \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":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49a6b23a396a0ebaa3a313069463546c75605649f02d4c85d5ae539c8369d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): horus_core/src/communication/mod.rs:90-96 | horus_core/src/communication/topic/header.rs:1565-1571 \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":"horus_core/src/communication/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c727ccadc1bdf4dc256b991e7062aca44a733de71e58ee6a9dded8f154f39b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): horus_core/src/core/presence.rs:514-518 | horus_manager/src/commands/launch.rs:277-281 \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":"horus_core/src/core/presence.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba21086a869132aafd11dcb68c34ad7a7ca09866408bd7153687f9d67284cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): horus_core/src/scheduling/async_executor.rs:447-458 | horus_core/src/scheduling/compute_executor.rs:910-921 \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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc205c6073591935bf1b8d1df9077ee0fadbcf9e97157d5a477124969d6253ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): horus_cpp_macros/src/cpp_gen.rs:294-301 | horus_cpp_macros/src/cxx_gen.rs:266-273 \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":"horus_cpp_macros/src/cpp_gen.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94545ec60b3a59786f8c4dfc2fb5cb6c3ef3b691012670bb54deae823d59550"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): horus_core/src/core/hlog.rs:243-249 | horus_core/src/core/tick_context.rs:182-189 \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":"horus_core/src/core/hlog.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c695bb1d9235b0b830d58dd45cfe402a77dc09acde721838ac5595f34410a0ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): horus_core/src/services/client.rs:65-73 | horus_cpp/src/action_ffi.rs:45-48 | horus_cpp/src/service_ffi.rs:41-44 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/services/client.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1568caeaf06382b55afa6a778c97a4c76136f7d6c16c8fa1706f450a86c554e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): horus_manager/src/fingerprint.rs:83-87 | horus_manager/src/lockfile.rs:731-736 \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":"horus_manager/src/fingerprint.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bc2fc4db79e60fbc7bbae4418fca34434279bfb8279ac1e4892b6263e14092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): horus_py/src/depth_image.rs:130-133 | horus_py/src/image.rs:202-205 | horus_py/src/pointcloud.rs:95-98 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/depth_image.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72fae968a7777c2a170857722be14d555fef9fc7c98ccfc8f9962a195915ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): horus_core/src/scheduling/record_replay.rs:1398-1407 | horus_manager/src/lockfile.rs:178-185 \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":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1e5ee46b19c933f309337662c70b1957dfb43829be1de33ad4c0feb2922238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): horus_py/src/depth_image.rs:180-184 | horus_py/src/image.rs:267-272 \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":"horus_py/src/depth_image.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefc263ef4c88b54faada8aef8f7537688e6704a2a92130e7684bb770b4b182d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): horus_py/src/perception.rs:402-404 | horus_types/src/math.rs:249-251 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/perception.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9849941c8c4c0e695efc9d5d3701ae3a120457b98d3e7b57ef92608f38a5b444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (70\u201377 lines \u00D7 2): horus_manager/src/registry/install.rs:728-804 | horus_manager/src/registry/install.rs:1154-1223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:728\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf207c80cee90ee7ac803d0925c385ef7b0822fb6aae32e3b7296291b9055d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201346 lines \u00D7 2): horus_manager/src/registry/install.rs:536-581 | horus_manager/src/registry/install.rs:1012-1056 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:536\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":"horus_manager/src/registry/install.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e2e3993260b1ac49d949ab5c7172d7e82cc6e5c20d68f12a3f58b4c841f11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201346 lines \u00D7 2): horus_sys/src/shm/fallback.rs:205-248 | horus_sys/src/shm/linux.rs:294-339 \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 \u0060horus_sys/src/shm/fallback.rs:205\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":"horus_sys/src/shm/fallback.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ab3ff2fda57cab7c85b0e5d9d4a8ed02e93a28311765df3c2efe4429cba824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201345 lines \u00D7 2): horus_py/src/tensor.rs:257-301 | horus_py/src/tensor.rs:1189-1220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_py/src/tensor.rs:257\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":"horus_py/src/tensor.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae1c751d01932beb90dc8fac0b1e111afb605b64f29a621f009d0e19b3c15e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201342 lines \u00D7 2): horus_manager/src/registry/helpers.rs:108-149 | horus_manager/src/registry/helpers.rs:171-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/helpers.rs:108\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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0220b03b8e5b14753e7c734088c79dab9dbf8bbf93f15172b9fc515883b47ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201341 lines \u00D7 2): horus_manager/src/registry/install.rs:806-846 | horus_manager/src/registry/install.rs:1225-1261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:806\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"c242d741b9969916cf9bd91d96e02e03f3adf9a5e09f55e71a441ab17546405a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201340 lines \u00D7 3): horus_core/src/communication/topic/mod.rs:4496-4535 | horus_core/src/communication/topic/mod.rs:4575-4612 | horus_core/src/communication/topic/mod.rs:4622-4657 \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 \u0060horus_core/src/communication/topic/mod.rs:4496\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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":4496}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb378e691d96a2727665484cc159b25d8958a81219b6c2aa4ed02028c7311e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201340 lines \u00D7 2): horus_manager/src/commands/run/run_rust.rs:326-365 | horus_manager/src/commands/run/run_rust.rs:417-455 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e288e9def87cd8fe50932ad920815ef862d281bfd34b882173668889573756c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201339 lines \u00D7 2): horus_core/src/drivers/mod.rs:207-245 | horus_core/src/drivers/mod.rs:390-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/drivers/mod.rs:207\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/drivers/mod.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6f7323db1e00f9c24fd0e0398e7a5f610e24174b9e14c53e8d52af59b371d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): horus_manager/src/commands/topic.rs:1009-1046 | horus_manager/src/commands/topic.rs:1166-1202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/topic.rs:1009\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"511b8ab3644996307c4ff4bcc255c08348fd2b65f85eede137ff33b2b4012369"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): horus_core/src/memory/costmap.rs:383-418 | horus_core/src/memory/occupancy_grid.rs:197-232 \u2014 before extracting anything, compare \u0060horus_core/src/memory/costmap.rs\u0060 and \u0060horus_core/src/memory/occupancy_grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"horus_core/src/memory/costmap.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c2c5bbe578f457b33c0552697636f6cc7714944390e28b82581cd9f950e5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:1982-2028 | horus_core/src/memory/tensor_pool.rs:2075-2121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/memory/tensor_pool.rs:1982\u0060 it begins part-way through the construct above it, so those exact 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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb63f2b1aabf57102979f203b00c4ceecf7fd1623837acd828f87accda58515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): horus_core/src/scheduling/async_executor.rs:337-372 | horus_core/src/scheduling/compute_executor.rs:800-835 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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 \u0060horus_core/src/scheduling/async_executor.rs:337\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8c6acb0df8c160f8d3e375d473f1e83e381235b5f0aa26f9b447461da9fd0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201335 lines \u00D7 3): horus_core/src/communication/topic/dispatch.rs:1985-2019 | horus_core/src/communication/topic/dispatch.rs:2084-2111 | horus_core/src/communication/topic/dispatch.rs:2502-2536 \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 \u0060horus_core/src/communication/topic/dispatch.rs:1985\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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"f559806494761c5cacfb9fec0ed1078b534889957602b909178b48468e336513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201335 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:1487-1521 | horus_core/src/communication/topic/dispatch.rs:1821-1847 \u2014 both copies are in the same file, so extract the block 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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96fad81b6325e601da42bcd46bf4089f1c5dbe16549f29b1e0eb6bf5ba69451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201334 lines \u00D7 4): horus_core/src/scheduling/async_executor.rs:382-410 | horus_core/src/scheduling/compute_executor.rs:845-873 | horus_core/src/scheduling/event_executor.rs:494-527 | horus_core/src/scheduling/rt_executor.rs:1843-1873 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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 \u0060horus_core/src/scheduling/async_executor.rs:382\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee0fe328b97f2b31b84476d682252b0c34cceed2f7bb5238c9c88a257bbacc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:436-467 | horus_core/src/memory/tensor_pool.rs:740-770 \u2014 both copies are in the same file, so extract the block 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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afa2147e03b12add7ea174c1556b4d4f290f0faaac2181337891917a9cc3aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): horus_manager/src/commands/pkg.rs:190-220 | horus_manager/src/commands/pkg.rs:290-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0484199531e37f68fe8d88d887a17994dc8224382d04d0cfd9efe6d2abfb1d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:2237-2266 | horus_core/src/communication/topic/dispatch.rs:2320-2348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/dispatch.rs:2237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd40419fef2a9147a126d87ec8f27eb8dd50c5982c70473df07792c90b05485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): horus_manager/src/commands/doc_extract_rust.rs:785-814 | horus_manager/src/commands/doc_extract_rust.rs:828-857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_rust.rs:785\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d56e7d52d6ffa57ff7fc44d4caf26e844f49d032bd1ec73df3d800eb2dc8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): horus_manager/src/commands/migrate.rs:235-279 | horus_manager/src/commands/migrate.rs:282-326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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 \u0060t\u0060 to \u0060\u0026toml_edit::InlineTable\u0060 in one and \u0060\u0026toml_edit::Table\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":"horus_manager/src/commands/migrate.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab83c7daaa66c70a838837fe1fd4f06d73f817474d9af2cb57f17b0060c3bf1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): horus_manager/src/registry/install.rs:1517-1546 | horus_manager/src/registry/install.rs:1754-1783 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:1517\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":"horus_manager/src/registry/install.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"19463e260dc416cfa381b66fc9d31ff0567c2aec919afc95f2ad8d61e19c3b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201329 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:1101-1129 | horus_core/src/communication/topic/dispatch.rs:1146-1156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_core/src/communication/topic/dispatch.rs:1129\u0060 calls \u0060release\u0060 and \u0060horus_core/src/communication/topic/dispatch.rs:1156\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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f96c63be923214eb17f8f56df6c2b8e02f777386da04dccdd5aa2dd1822586"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201329 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:2052-2080 | horus_core/src/communication/topic/dispatch.rs:2475-2494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/dispatch.rs:2052\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d88759a047a77ca6b2caa18f55a8d54ef4dbb20ca24e496d5135f9578211b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201328 lines \u00D7 2): horus_manager/src/registry/install.rs:695-722 | horus_manager/src/registry/install.rs:1128-1150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:695\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":"horus_manager/src/registry/install.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"666d4eb6dff04b3880530c8ed892e72f9c3cc975cd1544d45603b10f4a24ecf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201328 lines \u00D7 2): horus_manager/src/registry/install.rs:851-878 | horus_manager/src/registry/install.rs:1266-1288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:851\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":"horus_manager/src/registry/install.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b90188abfd4f827fa5de2b2bda82a8ff4d0e597f38502f5a21ef83d437d48f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201327 lines \u00D7 3): horus_core/src/communication/topic/dispatch.rs:712-724 | horus_core/src/communication/topic/dispatch.rs:2237-2256 | horus_core/src/communication/topic/dispatch.rs:2320-2346 \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 before the matched lines, \u0060horus_core/src/communication/topic/dispatch.rs:2210\u0060 calls \u0060wrapping_sub\u0060 and \u0060horus_core/src/communication/topic/dispatch.rs:711\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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"e993f1326ea85819330570ca16206127dfecee681183d398d4dd4ff647d34b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): horus_manager/src/registry/install.rs:1675-1701 | horus_manager/src/registry/install.rs:1944-1970 | horus_manager/src/registry/install.rs:2210-2236 \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":"horus_manager/src/registry/install.rs"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3965a674a4c6043952dddc6a303392b33b2ba5ab0abedd16a4883bd704c1c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): horus_manager/src/commands/run/run_rust.rs:927-953 | horus_manager/src/commands/run/run_rust.rs:1029-1055 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"319c008b3d168d9df027e6762b7fc6c58c92a72c70536dbaa8494c99f733ac51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:1952-1977 | horus_core/src/memory/tensor_pool.rs:2047-2070 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/memory/tensor_pool.rs:1952\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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba84e1d5901116d6542d594ddf8e109e11598bfa97f9173e37356147329c9822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): horus_sys/src/discover/macos.rs:236-261 | horus_sys/src/discover/macos.rs:280-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_sys/src/discover/macos.rs:236\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/macos.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfdc30331cf218db0e4a82d5b86106bda6c2e2d8931a1a98e45a880585ea563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201326 lines \u00D7 3): horus_sys/src/discover/windows.rs:189-214 | horus_sys/src/discover/windows.rs:251-276 | horus_sys/src/process/mod.rs:435-438 \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 \u0060horus_sys/src/discover/windows.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_sys/src/process/mod.rs:438\u0060 calls \u0060GetProcessTimes\u0060, \u0060CloseHandle\u0060 and \u0060horus_sys/src/discover/windows.rs:214\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":"horus_sys/src/discover/windows.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba752c1ffffafbdbbfc33273bdabc930880498b339847b77ac103e4a7b76f268"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:2397-2421 | horus_core/src/communication/topic/dispatch.rs:2447-2471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/dispatch.rs:2397\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d083c89478fb7eec07919d18c384b70e17aeeb2f5c44d665ba976b0711fc9c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201325 lines \u00D7 2): horus_core/src/communication/topic/header.rs:978-1002 | horus_core/src/communication/topic/header.rs:1257-1274 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/header.rs:978\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d224304d2ce53dde70b772b8f2dde441903e7a301884416ae7e40a203cab4b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201325 lines \u00D7 3): horus_core/src/drivers/mod.rs:157-181 | horus_core/src/drivers/mod.rs:322-324 | horus_core/src/drivers/mod.rs:357-379 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060horus_core/src/drivers/mod.rs:155\u0060 calls \u0060map_err\u0060, \u0060Other\u0060, \u0060display\u0060 and \u0060horus_core/src/drivers/mod.rs:322\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":"horus_core/src/drivers/mod.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"083754115f2f8e40850c85a7e3ea0418f586abd5a24463f42f6a793c4ffa2d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): horus_core/src/scheduling/scheduler/mod.rs:2818-2842 | horus_core/src/scheduling/scheduler/mod.rs:3232-3256 \u2014 both copies are in the same file, so extract the block 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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":2818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3721f98bce144157c2c0d90c5cab71dedd6f403df2c834ffa9a45f4895217d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): horus_core/src/actions/client.rs:872-895 | horus_core/src/actions/client.rs:932-955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/actions/client.rs:872\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/client.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4d3e622278050419830640f33cb1cbc487921e6d83e82f055656336c4c9cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): horus_manager/src/commands/run/install.rs:1374-1397 | horus_manager/src/commands/run/install.rs:1816-1839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/install.rs:1374\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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e719e801b1a0f64f9b1d238720d618ea3d280c2e78b992868d01f3fc4d3ccad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): horus_sys/src/shm/fallback.rs:48-67 | horus_sys/src/shm/linux.rs:64-87 \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 \u0060horus_sys/src/shm/fallback.rs:48\u0060 it begins part-way through the construct above it, so those exact 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, \u0060horus_sys/src/shm/linux.rs:88\u0060 calls \u0060to_string\u0060 and \u0060horus_sys/src/shm/fallback.rs:68\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":"horus_sys/src/shm/fallback.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"392352f84defc948cf53edd6957af955edb9efd58f0b0bdd65bee3f51c4a79d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): horus_manager/src/commands/new.rs:174-196 | horus_manager/src/commands/new.rs:1068-1088 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/new.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"338d31b9baff79bc2d142d46bb08506a3d9cd5c6493be93610bbc43e01b97e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1291-1313 | horus_manager/src/commands/pkg.rs:1398-1420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1398\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea210027811d316d5e70d908fb4183420c208d62bd6b80b7fbc99841326c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): horus_net/src/wire.rs:448-470 | horus_net/src/wire.rs:498-520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_net/src/wire.rs:448\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_net/src/wire.rs:521\u0060 calls \u0060encode\u0060 and \u0060horus_net/src/wire.rs:471\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":"horus_net/src/wire.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2b783bba13ff867555bed8e8e88d7f59987168d4fb19784d813342d01fceae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): horus_macros/src/node.rs:523-544 | horus_macros/src/node.rs:548-569 \u2014 both copies are in the same file, so extract the block 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":"horus_macros/src/node.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d416a37f5b222cbc12b438f1750932d526ce029311c74efedb8742e6021f07e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): horus_sys/src/discover/mod.rs:345-366 | horus_sys/src/discover/mod.rs:402-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa853060f9d560586f94d7b4e6893a5529739bb3c82aed3a0957f4232c2bc987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): horus_core/src/scheduling/fault_tolerance/failure_policy.rs:190-210 | horus_core/src/scheduling/fault_tolerance/failure_policy.rs:418-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"horus_core/src/scheduling/fault_tolerance/failure_policy.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce558ff1cf5d30d2b6edc3692b05d8654d3a7405f20f583310b3e91d803484e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): horus_manager/src/commands/run/run_rust.rs:385-405 | horus_manager/src/commands/run/run_rust.rs:986-1006 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/run_rust.rs:385\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a2aa4d5e25f6e69c128a0bfdb50ca022a5961a4fd1e0f468fe26ce3572de78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): horus_py/src/tensor.rs:364-388 | horus_py/src/tensor.rs:434-458 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_py/src/tensor.rs:364\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/tensor.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e012eacaa70c4d5f87b1c060dfdb071272fac3d93987ad311955b6e01734d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 2): horus_sys/src/shm/macos.rs:92-104 | horus_sys/src/shm/macos.rs:163-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"horus_sys/src/shm/macos.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4074b21740d25c838423710b6d83311f3f51c900432472b6b0c11106e12d703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): horus_manager/src/commands/doc_extract_cpp.rs:703-722 | horus_manager/src/commands/doc_extract_rust.rs:1118-1137 \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 \u0060horus_manager/src/commands/doc_extract_cpp.rs:703\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":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b4c9588c13272aff5835f1da228b7b0bc773150fe8d9979872373b817ed3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): horus_manager/src/commands/topic.rs:797-815 | horus_manager/src/commands/topic.rs:1009-1027 | horus_manager/src/commands/topic.rs:1166-1183 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"878f7785883cb35e578cf49292194bf3593048a2f43610373ef28054cf9de3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): horus_core/src/memory/costmap.rs:422-440 | horus_core/src/memory/occupancy_grid.rs:236-254 \u2014 before extracting anything, compare \u0060horus_core/src/memory/costmap.rs\u0060 and \u0060horus_core/src/memory/occupancy_grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"horus_core/src/memory/costmap.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f286ee1e71c590bec403f4dd782bf75c03320e4edee5f1cd060ebedf99757666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): horus_core/src/scheduling/async_executor.rs:183-201 | horus_core/src/scheduling/compute_executor.rs:627-645 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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 \u0060horus_core/src/scheduling/async_executor.rs:183\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2d0218916ddac273d01a53901ddb85a403220267b7e106eca2d8a4b0f72427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): horus_core/src/types/action_chunk.rs:402-420 | horus_core/src/types/action_chunk.rs:432-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/types/action_chunk.rs:402\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060actions\u0060 to \u0060\u0026[f32]\u0060 in one and \u0060\u0026[f64]\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":"horus_core/src/types/action_chunk.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"77084ac9d64c7899c4e5b28f1ef059b1c665668ade218f7fd8278b355f175372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): horus_manager/src/registry/install.rs:2470-2488 | horus_manager/src/registry/install.rs:2529-2547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:2470\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":2470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cff91b303658e13f5e66ee4b4f5972d729bfdba358d42d5732710fef9933bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): horus_core/src/communication/topic/shm_fanout.rs:1031-1048 | horus_core/src/communication/topic/shm_fanout.rs:1093-1107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/shm_fanout.rs:1031\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/shm_fanout.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ecdc10ec351f84dc63c40a01dc4418961b81d1be0aa7b04ad5af638537e58d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:1548-1565 | horus_core/src/memory/tensor_pool.rs:1737-1754 \u2014 both copies are in the same file, so extract the block 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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fa02013b76230e44489b6498b8ef091e864f7d5f5a09584991230790208b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): horus_core/src/scheduling/async_executor.rs:360-376 | horus_core/src/scheduling/compute_executor.rs:823-839 | horus_core/src/scheduling/event_executor.rs:472-488 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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 \u0060horus_core/src/scheduling/async_executor.rs:360\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, \u0060horus_core/src/scheduling/event_executor.rs:470\u0060 calls \u0060Ok\u0060 and \u0060horus_core/src/scheduling/async_executor.rs:359\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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b685c6d9f4990e43fcaaa1660737c38d4eeb486e8ff39974a9278a02e5e657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): horus_core/src/core/hlog_rt.rs:188-204 | horus_core/src/scheduling/rt_executor.rs:197-213 \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 \u0060horus_core/src/core/hlog_rt.rs:188\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/hlog_rt.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cd3af1934ba2365c1ec9d6f7f7096f6996b974a85408c19d4e2d669779a9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:467-483 | horus_core/src/memory/tensor_pool.rs:663-676 \u2014 both copies are in the same file, so extract the block 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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2b5b1a7460ee5711f124f5b1cb29635be09bcff580d7f00c665a2177afb863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): horus_manager/src/commands/doc_extract_rust.rs:156-172 | horus_manager/src/commands/doc_extract_rust.rs:201-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_rust.rs:156\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_manager/src/commands/doc_extract_rust.rs:174\u0060 calls \u0060extract_derives\u0060 and \u0060horus_manager/src/commands/doc_extract_rust.rs:218\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"061029ba3e967459d9a9609d7cf4c896da7d7ea61d0825d431592e8153282c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1778-1794 | horus_manager/src/commands/pkg.rs:1880-1895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1778\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fd3042ceeed8420509dbad02ddeb7f07fa75d738b998040047093308786b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): horus_core/src/scheduling/scheduler/mod.rs:5094-5109 | horus_core/src/scheduling/scheduler/mod.rs:5310-5324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/scheduling/scheduler/mod.rs:5094\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5094}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a5020df9db006d42d1f10d3fa070bbcf9d9e45c28f327b2c31b4f928aec432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): horus_macros/src/node.rs:218-236 | horus_macros/src/node.rs:250-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0ea6675411a83247960ae7864d9856c693ad7d79b7595f845ec6398f352354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): horus_manager/src/commands/launch.rs:379-394 | horus_manager/src/commands/launch.rs:1319-1333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/launch.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd95f3d68b22c690d90ab6f44ab3b1505cb653143a18ec04f3c8e208912ccc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): horus_manager/src/registry/install.rs:505-520 | horus_manager/src/registry/install.rs:984-997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:505\u0060 it does not close everything it opens, so those exact 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e0a2f17c2fe59840a3915ca795da48a5eb196dc74fa3c3558c9ca7663ce78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): horus_net/src/event_loop/epoll.rs:131-146 | horus_net/src/event_loop/kqueue.rs:190-204 \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 \u0060horus_net/src/event_loop/epoll.rs:131\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":"horus_net/src/event_loop/epoll.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4221e263cd0a36ca9b50dc54b1541939828cee6ce08aeee4951604176d33f3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201316 lines \u00D7 5): horus_py/src/depth_image.rs:165-167 | horus_py/src/image.rs:253-255 | horus_py/src/pointcloud.rs:137-139 | horus_py/src/tensor.rs:385-396 | horus_py/src/tensor.rs:455-470 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/image.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 78 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":"horus_py/src/depth_image.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"50093893ae1e2198049e3669a6f445fae9cffa1e324c005ff0c785f21dae6d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): horus_sys/src/fs/mod.rs:357-377 | horus_sys/src/shm/mod.rs:420-435 \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 \u0060horus_sys/src/fs/mod.rs:357\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":"horus_sys/src/fs/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e0b2471b246fcbebb707237edaa9f37720dfa055508c911cdf4a2b571b9379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): horus_manager/src/commands/action.rs:251-265 | horus_manager/src/commands/msg.rs:68-82 | horus_manager/src/commands/node.rs:112-126 | horus_manager/src/commands/service.rs:132-146 | horus_manager/src/commands/topic.rs:34-48 \u2014 before extracting anything, compare \u0060horus_manager/src/commands/action.rs\u0060 and \u0060horus_manager/src/commands/service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/action.rs:251\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/action.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d0dfb914ea47bca30a53ca2a1dff069a79ed82a0455785ab344a9b42e0be43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): horus_py/src/topic.rs:1079-1092 | horus_py/src/topic.rs:1097-1110 | horus_py/src/topic.rs:1115-1129 | horus_py/src/topic.rs:1134-1147 \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 \u0060horus_py/src/topic.rs:1079\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":"horus_py/src/topic.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"1521242df7ce1828c432496da2daa80e9c9d2fbdc8cef803732fef3e24a95453"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): horus_manager/src/registry/install.rs:873-887 | horus_manager/src/registry/install.rs:1698-1712 | horus_manager/src/registry/install.rs:1967-1981 \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, \u0060horus_manager/src/registry/install.rs:1982\u0060 calls \u0060dimmed\u0060, \u0060display\u0060 and \u0060horus_manager/src/registry/install.rs:888\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":"horus_manager/src/registry/install.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d876c01dc5fd6d1d5737f47b0aa0dae8baff058696f9b8ea78bb68da6905bd1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): horus_core/src/actions/client.rs:209-223 | horus_core/src/actions/client.rs:922-936 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/actions/client.rs:209\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/client.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"267edc117a9e55eebe1543d17c5493210d4994536f3963afb0ba9f85ec8f4ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): horus_core/src/scheduling/record_replay.rs:85-100 | horus_core/src/scheduling/record_replay.rs:161-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/scheduling/record_replay.rs:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd3161804a75e4b31123dfb725768094dcf8457c8abeee47b0b7fd81ebe5734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): horus_manager/src/commands/deps.rs:113-127 | horus_manager/src/commands/deps.rs:255-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/deps.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deps.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d608c7050a872785291add14d6b414fe0cef0942fdc91fc5c0e154d975bd826f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): horus_manager/src/commands/new.rs:571-585 | horus_manager/src/commands/new.rs:616-630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/new.rs:571\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/new.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59a06cc61430a9ecf5afc2f20dfc86f536a11289f5c58dd161b60f39066f5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1601-1615 | horus_manager/src/commands/pkg.rs:1630-1644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1601\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60321f7c987ba138f2d260015faf4f2dba0a47ce62d35aaa44834cd128e4be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): horus_manager/src/commands/pod_decode.rs:62-76 | horus_manager/src/msgspec/mod.rs:103-117 \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":"horus_manager/src/commands/pod_decode.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c2e449d1d945c74e551c79bf02e84485d5630f898889a6c9a6b674e0ecebd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 2): horus_manager/src/commands/record.rs:765-779 | horus_manager/src/commands/record.rs:917-924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/record.rs:765\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/record.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7b753210d23a425e1cf1994f21d125321d31d649193fc3e5ea3275a1720bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): horus_manager/src/commands/run/deps.rs:529-543 | horus_manager/src/commands/run/deps.rs:546-560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/deps.rs:529\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":"horus_manager/src/commands/run/deps.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"392c6a44f2fb1dd64fdfaf84dd31c31d680a2d7dd5f61fcd3aef9e1a1ffb2f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): horus_manager/src/commands/run/run_rust.rs:164-176 | horus_manager/src/commands/run/run_rust.rs:689-703 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/run_rust.rs:164\u0060 it begins part-way through the construct above it, so those exact 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, \u0060horus_manager/src/commands/run/run_rust.rs:177\u0060 calls \u0060finish_error\u0060 and \u0060horus_manager/src/commands/run/run_rust.rs:704\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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc74865b4fbf569dd61496bff581b656c347cb00742dcc9aed25bf63e687dc9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): horus_manager/src/registry/helpers.rs:1285-1299 | horus_manager/src/registry/helpers.rs:1302-1316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/helpers.rs:1285\u0060 it does not close everything it opens, so those exact 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, \u0060horus_manager/src/registry/helpers.rs:1283\u0060 calls \u0060create_dir_all\u0060 and \u0060horus_manager/src/registry/helpers.rs:1301\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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac0b96f66c18e615f92c96932c56afa5f7e7e4280633c880583a68c43266e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 4): horus_core/src/scheduling/async_executor.rs:337-350 | horus_core/src/scheduling/compute_executor.rs:800-813 | horus_core/src/scheduling/event_executor.rs:453-462 | horus_core/src/scheduling/rt_executor.rs:1499-1512 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f5f142137714cb4980afd020e76f503cb7fac7240f38bb83667246c0f518c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): horus_core/src/scheduling/async_executor.rs:404-429 | horus_core/src/scheduling/compute_executor.rs:867-892 | horus_core/src/scheduling/rt_executor.rs:1894-1907 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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 \u0060horus_core/src/scheduling/async_executor.rs:404\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060horus_core/src/scheduling/rt_executor.rs:1894\u0060 calls \u0060Some\u0060 and \u0060horus_core/src/scheduling/async_executor.rs:404\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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"27454273b0189aa930f32a1af037832850ca7f030be5a9021785f1bf0a9efa23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:1601-1616 | horus_core/src/communication/topic/dispatch.rs:1746-1759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6893b2e83dc672c4c5705c8daaeb0b56c74eed1baced2c3198457115b643aee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:485-515 | horus_core/src/memory/tensor_pool.rs:772-802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/memory/tensor_pool.rs:485\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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d10c99417e2bb6603ebce42356c4b46edb620cf661e54a139f05b6039f90145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:2598-2611 | horus_core/src/memory/tensor_pool.rs:2633-2646 \u2014 both copies are in the same file, so extract the block 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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ac524dbc4987325afd2cc492234c004a6ed51e82bb98a9a7c02658b2b8e931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): horus_core/src/params.rs:266-279 | horus_core/src/params.rs:373-384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/params.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eac5b8303f4cbd3f22cee1d6727939dbe85b3257c6c8430846e69beee4ed644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): horus_core/src/types/dtype.rs:200-212 | horus_py/src/tensor_convert.rs:40-53 \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 \u0060horus_py/src/tensor_convert.rs:40\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/types/dtype.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"09accd344bca24e75bcdd7d182105910e75667693c5147ea376cbc175a79fa9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): horus_manager/src/commands/fmt.rs:46-59 | horus_manager/src/commands/lint.rs:31-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/fmt.rs:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/fmt.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde6693a188ca353b444889b673ffdfa5637c647035c1d9f4c3d1fed3e855929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): horus_manager/src/commands/github_auth.rs:626-639 | horus_manager/src/commands/github_auth.rs:705-718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f887b252a36ca8864de8d628cbc5c33f96f9d0d1bfbc03ee7ef7d5540df9e62e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): horus_manager/src/commands/proxy.rs:1028-1041 | horus_manager/src/commands/proxy.rs:1096-1109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/proxy.rs:1028\u0060 it does not close everything it opens, so those exact 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":"horus_manager/src/commands/proxy.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b257822eed7a7f87b729f6781fd9dd36f48f7787a0b27a85111f86c78a3fec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): horus_manager/src/commands/run/run_rust.rs:677-690 | horus_manager/src/commands/run/run_rust.rs:829-842 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c1b3c0144e6f2198e72316e164ca151cdb2fd23e65149f4a8d87da5c6ffe0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): horus_manager/src/commands/service.rs:283-296 | horus_manager/src/commands/service.rs:299-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"horus_manager/src/commands/service.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd52dbd2570a4f5df8a73f1bdbda578b3f616e9cfa1c9366a736fc725666392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): horus_manager/src/registry/publish.rs:876-888 | horus_manager/src/registry/publish.rs:1118-1131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/publish.rs:876\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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f4285df6595345acade6623022284cd358c3b4ea57df1250eecf64b73483e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): horus_py/src/node.rs:192-205 | horus_py/src/node.rs:219-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_py/src/node.rs:192\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/node.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ed37198b0885dce2c189e45555d18fa944ace7939f69eb03af2d5cf94d2ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): horus_sys/src/shm/linux.rs:62-69 | horus_sys/src/shm/linux.rs:172-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_sys/src/shm/linux.rs:172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_sys/src/shm/linux.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e74e9285a75e85a58fe08b60f1790773dcf1090a77010b8cb94f36e880ada2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 4): horus_manager/src/registry/publish.rs:986-998 | horus_manager/src/registry/publish.rs:1041-1053 | horus_manager/src/registry/publish.rs:1217-1226 | horus_manager/src/registry/publish.rs:1237-1246 \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 \u0060horus_manager/src/registry/publish.rs:986\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c34d9440b44d7ca42765229dc9d6ef6564c85f7000fbe377e96335d9fb05ed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): horus_py/src/topic.rs:819-831 | horus_py/src/topic.rs:841-853 | horus_py/src/topic.rs:863-875 \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 \u0060horus_py/src/topic.rs:819\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/topic.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"e401e1791b8ac5eaba9c0afb243a4d4e3b1012636091476f2df4e607d250b5c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:1655-1667 | horus_core/src/communication/topic/dispatch.rs:1710-1721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/dispatch.rs:1655\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb48ed34d2290e64ea83fdb34d3f53d3b6dcedb1ee10dab87f09c1e1b8f83ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_core/src/error.rs:1383-1396 | horus_core/src/services/client.rs:233-245 \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 \u0060horus_core/src/error.rs:1383\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":"horus_core/src/error.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a482448cc86fe1019bb65db81b7cfa627cd4fa3e6748a193fe5c413e454e73ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:1520-1533 | horus_core/src/memory/tensor_pool.rs:1706-1718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/memory/tensor_pool.rs:1520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"640a58cac2fc295afb80fc671f6d3db9beaf67f011bdeec8b358c7d2f7977159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): horus_core/src/scheduling/async_executor.rs:211-222 | horus_core/src/scheduling/compute_executor.rs:678-690 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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 \u0060horus_core/src/scheduling/async_executor.rs:211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"989412a5878e34b706d52730eab1796519689f3362b88f454a4755437b9eaa4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_core/src/scheduling/scheduler/mod.rs:1658-1670 | horus_core/src/scheduling/scheduler/mod.rs:3154-3166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/scheduling/scheduler/mod.rs:1658\u0060 it does not close everything it opens, so those exact 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, \u0060horus_core/src/scheduling/scheduler/mod.rs:1671\u0060 calls \u0060print_line\u0060 and \u0060horus_core/src/scheduling/scheduler/mod.rs:3167\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":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a03c28ef27ef7d2600b18f6fd0e31eb78b5e7d3b39f3a0628dfeeec3dc06f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_core/src/scheduling/scheduler/mod.rs:4002-4014 | horus_core/src/scheduling/scheduler/mod.rs:4148-4160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/scheduling/scheduler/mod.rs:4002\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":4002}}}],"partialFingerprints":{"codehealthFindingId/v1":"193de6982c80d88276c82d54f8ff042257746b40db4d23304c354843021dcd46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_cpp_macros/src/cxx_gen.rs:292-304 | horus_manager/src/commands/service.rs:334-346 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"horus_cpp_macros/src/cxx_gen.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"980e4c7236c068168d69dd461634f47fb3992c2f73fe96c719d2db6617859f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): horus_manager/src/commands/doc_extract_cpp.rs:244-256 | horus_manager/src/commands/doc_extract_cpp.rs:343-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc160f167bc975f51941eae14b2a96151e0fa796da870e2f58eeba175670d88c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_manager/src/commands/doctor.rs:1330-1342 | horus_manager/src/commands/doctor.rs:1352-1364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doctor.rs:1330\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"62de61dfbcd7b498ea0b4f6dc9cd9e88bee18312ea41d7d07794fc20d586cf84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_manager/src/commands/doctor.rs:1655-1667 | horus_manager/src/commands/upgrade.rs:753-765 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"56763a7bb689dee3dfb2208e312824b0c7f3d122c5ba50ea002de5e2974c14e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_manager/src/commands/run/run_python.rs:47-59 | horus_manager/src/commands/run/run_python.rs:71-83 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/run_python.rs:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060horus_manager/src/commands/run/run_python.rs:46\u0060 calls \u0060env\u0060 and \u0060horus_manager/src/commands/run/run_python.rs:70\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":"horus_manager/src/commands/run/run_python.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"07949ea47a437de71503f1d90f3e8a823e33abae6e8a480c1810063596650e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): horus_manager/src/commands/topic.rs:1131-1143 | horus_manager/src/commands/topic.rs:1303-1314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/topic.rs:1131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7a428286f498c4eb12b108c3d93bbfcac2a4fccdb9acbe97d61c00e3a5f663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): horus_manager/src/registry/helpers.rs:853-865 | horus_manager/src/registry/helpers.rs:933-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/helpers.rs:853\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4eaabf142adffb202f8db94e7cd42ab13a6a1cefad67d900777a98d55991c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): horus_manager/src/registry/install.rs:275-286 | horus_manager/src/registry/install.rs:2357-2369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:275\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8814179c8043235aab188e7d8e6128deedee8cfe5ef12dd7cc0a7c5c48589e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_net/src/log_replication.rs:157-169 | horus_net/src/presence.rs:149-161 \u2014 before extracting anything, compare \u0060horus_net/src/log_replication.rs\u0060 and \u0060horus_net/src/presence.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/log_replication.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9df0dd8b847f858811a4cd6d7574c112129dfda6bb5f4d116f5b9ba9b64abed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): horus_manager/src/commands/run/run_rust.rs:575-584 | horus_manager/src/commands/run/run_rust.rs:966-977 | horus_manager/src/commands/run/run_rust.rs:1067-1078 \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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"7647f38f6b77f772b608efb9a0d853354787b495bd57dcbfefae250d57097a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_core/src/communication/topic/header.rs:2151-2163 | horus_core/src/communication/topic/header.rs:2183-2194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/header.rs:2151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4510aa1cd1bdfce30a9fd9498ebb89ab76b6a3396ddaaead0173f26e1adbcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:417-428 | horus_core/src/memory/tensor_pool.rs:720-729 \u2014 both copies are in the same file, so extract the block 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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f9a68ef295f6650b168204b49cbc5b5b35fd21d9d8db36d64c4c0b938544d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): horus_core/src/scheduling/async_executor.rs:305-314 | horus_core/src/scheduling/compute_executor.rs:718-729 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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 \u0060horus_core/src/scheduling/async_executor.rs:305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56175c8c51307be5326d06c12389432aa33d972d423fda11801de230c15fbeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): horus_core/src/scheduling/scheduler/mod.rs:2971-2981 | horus_core/src/scheduling/scheduler/mod.rs:4743-4754 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/scheduling/scheduler/mod.rs:2971\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":2971}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dd0c624fc7296e2c74078f403e98f684ccda6c91d170e67a4a6753d580f234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): horus_core/src/types/image_encoding.rs:140-150 | horus_py/src/image.rs:46-57 \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 \u0060horus_py/src/image.rs:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_core/src/types/image_encoding.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cdbfb5494670c2edd6363bd84349f301577576edcb9874417c903f26fd99e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_manager/src/commands/action.rs:152-163 | horus_manager/src/commands/action.rs:165-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/action.rs:152\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060horus_manager/src/commands/action.rs:149\u0060 calls \u0060Ok\u0060, \u0060discover_nodes\u0060 and \u0060horus_manager/src/commands/action.rs:163\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":"horus_manager/src/commands/action.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e079403a8471d7714524273df46ca4fa9218bc34e720edad52e3bc07c026342"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_manager/src/commands/action.rs:361-372 | horus_manager/src/commands/service.rs:212-223 \u2014 before extracting anything, compare \u0060horus_manager/src/commands/action.rs\u0060 and \u0060horus_manager/src/commands/service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/action.rs:361\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_manager/src/commands/action.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee303e5dd5e38766cec111b5ffd194790b991d6390b3aac9ba420a97bd03a1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): horus_manager/src/commands/check.rs:376-387 | horus_manager/src/commands/check.rs:431-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/check.rs:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_manager/src/commands/check.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90ddf7d4d3d2f429f742f2a1c8d64dd90164aa5beae10f9331565041031a1a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_manager/src/commands/deps.rs:66-77 | horus_manager/src/commands/deps.rs:167-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/deps.rs:66\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deps.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ac77d012c18f3cdb476aa434fe37c483b273ef8f5a55219b474c8befe49138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): horus_manager/src/commands/record.rs:809-820 | horus_manager/src/commands/record.rs:932-939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/record.rs:809\u0060 it does not close everything it opens, so those exact 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, \u0060horus_manager/src/commands/record.rs:942\u0060 calls \u0060Err\u0060 and \u0060horus_manager/src/commands/record.rs:821\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":"horus_manager/src/commands/record.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"318884ac5ef6ffbfaae04c38180f80daebfd6c5894c319c5a3137d5847501ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_manager/src/commands/run/install.rs:317-328 | horus_manager/src/commands/run/install.rs:819-830 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/install.rs:317\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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e934660dcb2a18597bbf263c2bef25c585b4b7bfe3a1ff513d09d349868ed77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_manager/src/commands/service.rs:64-75 | horus_manager/src/commands/service.rs:93-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/service.rs:64\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/service.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddc5755571ccd82103e7a53a7d1bf2f53f83943d053afb1a9fcb295e2cc3b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_manager/src/commands/topic.rs:1048-1059 | horus_manager/src/commands/topic.rs:1204-1215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/topic.rs:1048\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_manager/src/commands/topic.rs:1063\u0060 calls \u0060read_topic_messages_total\u0060, \u0060unwrap_or\u0060 and \u0060horus_manager/src/commands/topic.rs:1218\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":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf7af3d6e652e38e20a8ec78b323fa49a536b4783cfd5cd88a9f7a7cbfabf5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): horus_manager/src/commands/run/run_rust.rs:163-173 | horus_manager/src/commands/run/run_rust.rs:330-342 | horus_manager/src/commands/run/run_rust.rs:421-432 | horus_manager/src/commands/run/run_rust.rs:688-700 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_manager/src/commands/run/run_rust.rs:177\u0060 calls \u0060finish_error\u0060 and \u0060horus_manager/src/commands/run/run_rust.rs:704\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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb05dac7012a4defb5b270353d6f19e753c039a529317fa93ff6aaff9c53ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): horus_core/src/communication/topic/header.rs:1833-1853 | horus_core/src/communication/topic/header.rs:2152-2163 | horus_core/src/communication/topic/header.rs:2184-2194 \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 \u0060horus_core/src/communication/topic/header.rs:1833\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5091c1f16f3f73832c7da47d42814e295e5621c7463536837f86778c42ad39c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): horus_manager/src/commands/doc.rs:52-61 | horus_manager/src/commands/fmt.rs:117-127 | horus_manager/src/commands/lint.rs:128-137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc.rs:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_manager/src/commands/doc.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3611626df777f1527b33c1907634d1b05a7aacd637eb492fca937c93861b7678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): horus_manager/src/registry/install.rs:2198-2208 | horus_manager/src/registry/install.rs:2471-2481 | horus_manager/src/registry/install.rs:2530-2540 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c498953e86f7b05ec4877c0a75dc476b586b08c96414e0e25417fc868525d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): horus_net/src/log_replication.rs:159-169 | horus_net/src/presence.rs:151-161 | horus_net/src/presence.rs:170-178 \u2014 before extracting anything, compare \u0060horus_net/src/log_replication.rs\u0060 and \u0060horus_net/src/presence.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_net/src/log_replication.rs:159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/log_replication.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae68e8f289ab55f6cdde28c270ec7d93001f4f13355399b2b3cc83694af83794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_core/src/core/presence.rs:412-423 | horus_core/src/core/presence.rs:433-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/core/presence.rs:412\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":"horus_core/src/core/presence.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"beddf2116c3dfb4053dcb7cfde100def16a21f69209d999f60cc41a9d9814932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): horus_core/src/memory/tensor_handle.rs:230-240 | horus_core/src/memory/tensor_handle.rs:258-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/tensor_handle.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc9193741697f902d0d3277dbe7806b4d1881c6edd74837c7a1a2086dfb0e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): horus_cpp/src/transform_ffi.rs:69-78 | horus_cpp/src/transform_ffi.rs:90-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_cpp/src/transform_ffi.rs:69\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/transform_ffi.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d78d0ab24d1fe068c1cb9550e17e5ba24c4bce5b7ee41b80d04de567d3694f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): horus_manager/src/registry/publish.rs:1067-1077 | horus_manager/src/registry/publish.rs:1193-1200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/publish.rs:1067\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb054007382216c119d755ddc39a8acdda94ba3615df34792e267cbd2120866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): horus_net/src/discovery.rs:171-181 | horus_net/src/wire.rs:70-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"horus_net/src/discovery.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d01e432fdc457ecc2c6edb9a0fd1ad2451a3dad2da5629aabbfad6d6bbb9504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): horus_manager/src/commands/run/run_rust.rs:352-361 | horus_manager/src/commands/run/run_rust.rs:442-451 | horus_manager/src/commands/run/run_rust.rs:550-557 \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 \u0060horus_manager/src/commands/run/run_rust.rs:352\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7beda58333346d7762d765d9066dda651e8f6dcd8bdb6fc7c3274f11d3415396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): horus_net/src/estop.rs:134-143 | horus_net/src/presence.rs:194-203 | horus_net/src/presence.rs:260-269 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/estop.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"21769a4fb0a338cbb4698b5795b01036531db1c9c0b80cd0f05191153ac72100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): horus_net/src/log_replication.rs:180-189 | horus_net/src/log_replication.rs:199-208 | horus_net/src/presence.rs:241-250 \u2014 before extracting anything, compare \u0060horus_net/src/log_replication.rs\u0060 and \u0060horus_net/src/presence.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/log_replication.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87449e333512fa758cfd449ad4e12eac516c76f5a290f5f5be37e5d27147008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): horus_cpp/src/c_api.rs:523-532 | horus_cpp/src/c_api.rs:1445-1453 \u2014 both copies are in the same file, so extract the block 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":"horus_cpp/src/c_api.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292d727c0a9d24827692ef7cb806c1634121f93bb02f560bfcf376c477c5bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_cpp/src/c_api.rs:2103-2112 | horus_cpp/src/c_api.rs:2144-2153 \u2014 both copies are in the same file, so extract the block 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":"horus_cpp/src/c_api.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8f2998e4bb3bd999fdf75eb38d3879221e9c344ee84af2c17d5d907bcb7bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/commands/doc_extract_rust.rs:289-298 | horus_manager/src/commands/doc_extract_rust.rs:301-310 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea8097be9b0a256e5e83ab6965ee13519cd40cbe00393b57bb777bedef648cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/commands/msg.rs:3096-3105 | horus_manager/src/commands/msg.rs:3140-3149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/msg.rs:3096\u0060 it begins part-way through the construct above it, so those exact 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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":3096}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c3515cbc699942a6914b883e79f0aa5289063b11b09e262e6ae70d53940d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/commands/run/install.rs:1419-1428 | horus_manager/src/registry/install.rs:2542-2551 \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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90cf1bd8a18b1f3890132301277cf8fcad24d29f9ea0bf383b324140f249fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): horus_manager/src/commands/run/mod.rs:550-559 | horus_manager/src/commands/run/run_rust.rs:757-764 \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 \u0060horus_manager/src/commands/run/mod.rs:550\u0060 it begins part-way through the construct above it, so those exact 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, \u0060horus_manager/src/commands/run/run_rust.rs:757\u0060 calls \u0060iter\u0060, \u0060enumerate\u0060 and \u0060horus_manager/src/commands/run/mod.rs:550\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":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bfc11d1f6efe774f1c83b3193189b3c6077c1c1c5795ce59b439589c0c20f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/commands/tf.rs:1164-1173 | horus_manager/src/commands/tf.rs:1189-1198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/tf.rs:1164\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_manager/src/commands/tf.rs:1199\u0060 calls \u0060insert\u0060 and \u0060horus_manager/src/commands/tf.rs:1174\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":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe381efbc7952ae7a7f1015e4ba52e19e7d1993053d946740939f0a56aa15af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/commands/tf.rs:1829-1838 | horus_manager/src/commands/tf.rs:1839-1848 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2c8f3929c007e9ecbffc2b30e09960ceb7203a7291f98737507d4a2459faec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/registry/install.rs:2292-2301 | horus_manager/src/registry/install.rs:2306-2315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:2292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f887c0d5a2628d3a520922bbb4088a32a8a3a502b0df7a7ecd57a58b4eedeb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/run_with_prefix.rs:93-102 | horus_manager/src/run_with_prefix.rs:155-164 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/run_with_prefix.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1260b9150173cb9f5789244f0661dacd56810619245c8fd9c3cb46775441c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_sys/src/platform/mod.rs:210-219 | horus_sys/src/platform/mod.rs:270-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_sys/src/platform/mod.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/platform/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4ef67f4d5991e272f351c1f8e382e3be43832618c865834998c26dbf6d6bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): horus_core/src/communication/topic/dispatch.rs:2038-2046 | horus_core/src/communication/topic/dispatch.rs:2408-2416 | horus_core/src/communication/topic/dispatch.rs:2458-2466 \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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3145b9a12405c98d5828eaa2c159dab3fe0291eb66d2686103f55b81adaf71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): horus_macros/src/node.rs:213-221 | horus_macros/src/node.rs:245-253 | horus_macros/src/node.rs:277-285 \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 \u0060horus_macros/src/node.rs:213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0844e95c58ec3591797cac370dab5c8b26ebb076420758e04d7d7bee3d0671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): horus_manager/src/dependency_resolver.rs:89-97 | horus_manager/src/dependency_resolver.rs:119-125 | horus_manager/src/dependency_resolver.rs:160-165 \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 \u0060horus_manager/src/dependency_resolver.rs:89\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/dependency_resolver.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fd92b1bd6d0b8b63036bfbbdb4a3e373dd0a218dd288b3ed91deb0862a4505"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): horus_py/src/depth_image.rs:270-278 | horus_py/src/image.rs:399-407 | horus_py/src/pointcloud.rs:244-252 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/image.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/depth_image.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"95904db73b67b514727256aeac263e1a50c42081e629403b6600d4a746efcb8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:1671-1679 | horus_core/src/communication/topic/dispatch.rs:1690-1698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/dispatch.rs:1671\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"8092558dab6b572d6c89da84b4afc6f562189d40388214540147be84a8a8a136"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:1719-1727 | horus_core/src/communication/topic/dispatch.rs:1863-1868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/dispatch.rs:1719\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eabb8ae055267a403abcaff55b621179867d5409ea1f227fa618ce34d1e4ca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): horus_cpp/src/node_ffi.rs:114-121 | horus_cpp/src/node_ffi.rs:163-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_cpp/src/node_ffi.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":"horus_cpp/src/node_ffi.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3690ad85ba5337428eebc657d4c227389578b1ae9d12e6227d838b13d7f271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/deploy.rs:1747-1755 | horus_manager/src/commands/deploy.rs:1763-1771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060horus_manager/src/commands/deploy.rs:1761\u0060 calls \u0060find_binary_name\u0060 and \u0060horus_manager/src/commands/deploy.rs:1744\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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"2531432bc409d4af49bbacb6458aa13347f8e57845853aeb60869b0bdb42238f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/deps.rs:144-152 | horus_manager/src/commands/deps.rs:318-326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/deps.rs:144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deps.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f3f44512cbd622774c54f5b5a32aadab1da2ac94341f4aa2b7107619796d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/doc_extract.rs:507-515 | horus_manager/src/commands/doc_extract_html.rs:185-193 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ca04148dccce010b808098a54cebb137f063fca715e0d7a3165ac360eae712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/doc_extract_diff.rs:159-167 | horus_manager/src/commands/doc_extract_diff.rs:172-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_diff.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_diff.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7c36efee05701e5774e77befc6f4de7d21f7af51a8ba8476506f595a24b39c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/doc_extract_python.rs:133-141 | horus_manager/src/commands/doc_extract_python.rs:201-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_python.rs:133\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_python.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"502d7e906dea00efb8d5f421af27989b4c5635d1c498cb04c3e509db50aa2f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/doctor.rs:1827-1835 | horus_manager/src/commands/run/run_rust.rs:1242-1250 \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 \u0060horus_manager/src/commands/doctor.rs:1827\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"9178bd5ef9540d3b02e2f7722240ccdf1a522e717d4ce55605553c4910ad1ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): horus_manager/src/commands/env.rs:326-334 | horus_manager/src/commands/setup_rt.rs:190-196 \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 \u0060horus_manager/src/commands/env.rs:326\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_manager/src/commands/setup_rt.rs:196\u0060 calls \u0060stdin\u0060, \u0060is_terminal\u0060, \u0060cyan\u0060 and \u0060horus_manager/src/commands/env.rs:334\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":"horus_manager/src/commands/env.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecc919ee17ec8c7eaaf39777e9fcb62325109f21bd461632f655989ff7c6b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/commands/launch.rs:625-634 | horus_manager/src/commands/launch.rs:648-657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/launch.rs:625\u0060 it does not close everything it opens, so those exact 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, \u0060horus_manager/src/commands/launch.rs:646\u0060 calls \u0060Some\u0060, \u0060iter_mut\u0060, \u0060find\u0060 and \u0060horus_manager/src/commands/launch.rs:623\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":"horus_manager/src/commands/launch.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a575601c9c4abf362f6f728f76622e37baf54ecb6399fd0161dad5bb0c73523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/pkg.rs:36-44 | horus_manager/src/commands/pkg.rs:60-68 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:36\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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f000a1ab5eb7e9f82b48a5534d9f1e38141c2cf304944cbe51d188e06fc87782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1280-1288 | horus_manager/src/commands/pkg.rs:1389-1396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1280\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6b4c16d61e6b7b1ccbb32a462a179fb20b625075b3ab55aefc55796261e7cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1817-1825 | horus_manager/src/commands/pkg.rs:1849-1856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1817\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"3578f8b0b104eac39ea5f514b2c69e34c6f486796cfc6e24171d102d11716452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/run/install.rs:1780-1788 | horus_manager/src/registry/install.rs:2271-2279 \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 \u0060horus_manager/src/commands/run/install.rs:1780\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"555156e2f8ad0ce0ddf2fe1d2d0044b0142cf67255fddc24ea39f0b829436b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): horus_manager/src/commands/upgrade.rs:937-951 | horus_manager/src/source_resolver.rs:965-978 \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 \u0060horus_manager/src/commands/upgrade.rs:937\u0060 it begins part-way through the construct above it, so those exact 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, \u0060horus_manager/src/source_resolver.rs:964\u0060 calls \u0060user_agent\u0060 and \u0060horus_manager/src/commands/upgrade.rs:936\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":"horus_manager/src/commands/upgrade.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a5e1ed6a642540f9d7dded17da6ad4311b34ca0463312ca1944e45abaf1b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/main.rs:2445-2453 | horus_manager/src/main.rs:2457-2465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/main.rs:2445\u0060 it begins part-way through the construct above it, so those exact 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, \u0060horus_manager/src/main.rs:2441\u0060 calls \u0060extract_exit_code\u0060 and \u0060horus_manager/src/main.rs:2453\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":"horus_manager/src/main.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35d053c16db5d179167628cb8b9263e9b9806bdd8e8f08591c39f731b6d29d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/msgspec/parse.rs:512-520 | horus_manager/src/msgspec/parse.rs:566-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/msgspec/parse.rs:512\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/msgspec/parse.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4161afddbdc4dda847f6b5261dc926b6dee7bc5c7b4b90500ee82b9691c4c48d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/registry/helpers.rs:76-84 | horus_manager/src/registry/helpers.rs:451-459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_manager/src/registry/helpers.rs:462\u0060 calls \u0060get\u0060, \u0060is_none\u0060, \u0060table\u0060 and \u0060horus_manager/src/registry/helpers.rs:87\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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5db97793db22532eea80cd567fd5988c84fd2b59f962aab0217a68ac71fb35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): horus_manager/src/registry/helpers.rs:1506-1513 | horus_manager/src/registry/helpers.rs:1523-1531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/helpers.rs:1506\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f092d74aeee5f199ecc8724734a38cb9d38fb85307350fbc0cd75ade1d20dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/system_deps.rs:492-500 | horus_manager/src/system_deps.rs:504-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/system_deps.rs:492\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/system_deps.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7d45c684df8dc36b9fd0be7d4346220275378ded6fa62c9b3913a958b74763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_py/src/messages.rs:1466-1474 | horus_py/src/messages.rs:2488-2496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_py/src/messages.rs:1466\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":"horus_py/src/messages.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1878e8b122747701516a266fe4dd65a5288957a77b736153479604922b25fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): horus_manager/src/registry/publish.rs:881-888 | horus_manager/src/registry/publish.rs:991-998 | horus_manager/src/registry/publish.rs:1046-1053 | horus_manager/src/registry/publish.rs:1070-1077 | horus_manager/src/registry/publish.rs:1124-1131 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/publish.rs:881\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fbc1a7428c29e2aa4c037aa5d9f5d48f36c659dca7b99edd7b8c13ab3dd4b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_core/src/actions/client.rs:217-224 | horus_core/src/actions/client.rs:870-877 | horus_core/src/actions/client.rs:930-937 \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 \u0060horus_core/src/actions/client.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/client.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cfdb91b43a3976baf190fc7b5c4f2abb0be032193af62cd3f21d1219ed1cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_core/src/communication/topic/mod.rs:4900-4907 | horus_core/src/communication/topic/mod.rs:4967-4974 | horus_core/src/communication/topic/mod.rs:5034-5041 \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 \u0060horus_core/src/communication/topic/mod.rs:4900\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":4900}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce593a29169f435615ecc769befa95f761aac61b32b3caa98beaabc3f955343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_cpp/src/c_api.rs:1281-1288 | horus_cpp/src/c_api.rs:1326-1333 | horus_cpp/src/c_api.rs:1371-1378 \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":"horus_cpp/src/c_api.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"166ea7f6c3f1c58bda4a8e5b6059a30591819b941c2f8bd0e41f08c59f81c8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_cpp/src/c_api.rs:1305-1312 | horus_cpp/src/c_api.rs:1350-1357 | horus_cpp/src/c_api.rs:1395-1402 \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":"horus_cpp/src/c_api.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"126fa22e1f4d4bfa38f66877e7d9d6eb3043b86279bdb8f6d3c0c0819b91f9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_cpp/src/c_api.rs:1904-1911 | horus_cpp/src/c_api.rs:1921-1928 | horus_cpp/src/c_api.rs:1938-1945 \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":"horus_cpp/src/c_api.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6800b82ca5e528b6e723b4f3fe823dc2e3b672bac41c4b9a18e4a37b4582a728"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_manager/src/registry/install.rs:691-698 | horus_manager/src/registry/install.rs:1530-1537 | horus_manager/src/registry/install.rs:1767-1774 \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 \u0060horus_manager/src/registry/install.rs:691\u0060 it does not close everything it opens, so those exact 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, \u0060horus_manager/src/registry/install.rs:688\u0060 calls \u0060package_name_to_path\u0060 and \u0060horus_manager/src/registry/install.rs:1527\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":"horus_manager/src/registry/install.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c6d5a415e9fb24df78c4eb0cab5339c74e006f8df79f588b277a894e8703d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): horus_py/src/depth_image.rs:158-175 | horus_py/src/image.rs:245-263 | horus_py/src/pointcloud.rs:130-147 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/image.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 78 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 \u0060horus_py/src/depth_image.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/depth_image.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da868f0273105997325a895623f6c706eb033b153b130d4d2ad5dd1fe50cefc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_py/src/topic.rs:1279-1286 | horus_py/src/topic.rs:1299-1306 | horus_py/src/topic.rs:1319-1326 \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 \u0060horus_py/src/topic.rs:1279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/topic.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a54537e351e88fa197c6398fa76c3c57330d211439f57cf7e9695d82704abf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_core/src/scheduling/scheduler/mod.rs:5084-5091 | horus_core/src/scheduling/scheduler/mod.rs:5279-5286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/scheduling/scheduler/mod.rs:5084\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":5084}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d3aa4c6b17cbe600815e948127493377a8a88019beffd95480b5ec3b60934e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_cpp/src/c_api.rs:1479-1486 | horus_cpp/src/c_api.rs:2056-2063 \u2014 both copies are in the same file, so extract the block 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":"horus_cpp/src/c_api.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"429138721af249fe14f1a589b891fc194d05de2e719e6bc6d14278e9b51cfa09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): horus_macros/src/node.rs:405-412 | horus_macros/src/node.rs:416-423 | horus_macros/src/node.rs:426-431 \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 \u0060horus_macros/src/node.rs:405\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f2717f11a93824cf5ef986b8d522779180266a01f74979fc7eee68608efe2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): horus_manager/src/commands/doc_extract_rust.rs:397-404 | horus_manager/src/commands/doc_extract_rust.rs:437-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_rust.rs:397\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0e3ef6a80f5246f046018705c978f4996e512ef57edd059de9563caf2b48f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/msg.rs:397-404 | horus_manager/src/commands/msg.rs:415-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/msg.rs:397\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/msg.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"22685b16a3969ba470091fff1d35bccce0e9e9235d32ee63c3f273140fd78628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1265-1272 | horus_manager/src/commands/pkg.rs:1375-1382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1265\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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ab91fe4d3d1ac685d9c0727396754b541b0f155637a7e0060c804f09b2d8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1482-1489 | horus_manager/src/commands/pkg.rs:1505-1513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b3a98db5a5f98f9b0b468d4c5a0077658ad6837d425a501002f58097accdd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/tf.rs:1129-1136 | horus_manager/src/commands/tf.rs:1230-1237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/tf.rs:1129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe62e86f3e36ca2ddeea500b4286f0a1191e61eaacddbb88d66ce20eecf10c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): horus_sys/src/discover/mod.rs:214-221 | horus_sys/src/shm/mod.rs:1163-1169 \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 \u0060horus_sys/src/discover/mod.rs:214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/mod.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f914a8ec73778c7f389e97b96475bd0eb528dd2a36fdb8cdc7bd6239245a35a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): horus_cpp/src/c_api.rs:1306-1312 | horus_cpp/src/c_api.rs:1351-1357 | horus_cpp/src/c_api.rs:1396-1402 | horus_cpp/src/c_api.rs:1476-1482 \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 \u0060horus_cpp/src/c_api.rs:1306\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a166171697a094ed03785749b14536a2b97409d792a6096e77c04a9e84964f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): horus_core/src/communication/topic/dispatch.rs:1489-1495 | horus_core/src/communication/topic/dispatch.rs:1764-1770 | horus_core/src/communication/topic/dispatch.rs:1823-1829 \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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"986b15f795fa3f19bdd1f2753b6e39a84930c01931e5557648c92e4fb7c8e56d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_cpp/src/c_api.rs:127-134 | horus_cpp/src/c_api.rs:242-249 | horus_cpp/src/c_api.rs:1558-1565 \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 \u0060horus_cpp/src/c_api.rs:127\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":"horus_cpp/src/c_api.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b34c8c2089c5ee7b38b02471fd5e7c74294958136a0b66f4e84d3e9097fe0c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): horus_cpp/src/c_api.rs:1989-1995 | horus_cpp/src/c_api.rs:2025-2031 | horus_cpp/src/c_api.rs:2053-2059 \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 \u0060horus_cpp/src/c_api.rs:1989\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/c_api.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a2c83b85e6c450d5b2dbe057359b809391596966c06fa4f6b911f7c3a1c222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_manager/src/commands/pkg.rs:1263-1270 | horus_manager/src/commands/pkg.rs:1373-1380 | horus_manager/src/commands/plugin.rs:471-478 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2f1cb283a89359e6304b21fd34cacd3c4f4bd7bcad3eb1caa77b4f5c196360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): horus_manager/src/commands/tf.rs:2155-2161 | horus_manager/src/commands/tf.rs:2167-2173 | horus_manager/src/commands/tf.rs:2179-2185 \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 \u0060horus_manager/src/commands/tf.rs:2155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8b0386207c09a98e11d4982e33ae05fae72b8f852de83b8cb865ff3c581e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_core/src/core/presence.rs:523-530 | horus_core/src/scheduling/registry.rs:493-499 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/core/presence.rs:523\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/presence.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8609bf654d25072ec27fa2e3b7d38953872d603f21d20e57f9c3ac5351f90b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): horus_core/src/memory/pointcloud.rs:78-84 | horus_core/src/memory/pointcloud.rs:102-108 | horus_core/src/memory/pointcloud.rs:118-120 \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 \u0060horus_core/src/memory/pointcloud.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_core/src/memory/pointcloud.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb373347c81df093c1408754d2c70da52402ad68fa6018d061740af28fac7bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/doc.rs:42-48 | horus_manager/src/commands/fmt.rs:80-87 \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 \u0060horus_manager/src/commands/doc.rs:42\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a25a3c5cc3be198c02183ed94be93abb0bfccdb6ce65168e7182e5c2cf5da93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/doc_extract_rust.rs:546-552 | horus_manager/src/commands/doc_extract_rust.rs:580-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_rust.rs:546\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a574c3f28116937daec2a61a693aa1ac2ce949f2cad09dbdddff1afbf68b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/pkg.rs:426-434 | horus_manager/src/registry/helpers.rs:665-673 \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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa995d75aa2e5b2786549d58b8146faa1f1acdbcae0293f2960dcbf16ebe5a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1991-1998 | horus_manager/src/commands/pkg.rs:2008-2015 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1991\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c72fbe38176ce649bb43aceb62bc39b2d7a17b8f025366399fa0c3d30a6a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/run/install.rs:496-502 | horus_manager/src/commands/run/install.rs:903-909 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/install.rs:496\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e24f651b86bf2dc3374d201179094b2e6db2ca673c062fb49c3a3be36706de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/run/run_rust.rs:1125-1131 | horus_manager/src/commands/run/run_rust.rs:1135-1141 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff629ad15ecb7b34ce0205bba5fc71193ea9fc262b2285960b1a8143b7550019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/topic.rs:405-411 | horus_manager/src/commands/topic.rs:477-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a5f1224d9dc491e59f0503cc9c0868fa4558e72812fbea2d54893ca56dc5e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_net/src/optimize/predict.rs:143-149 | horus_net/src/optimize/predict.rs:155-161 \u2014 both copies are in the same file, so extract the block 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":"horus_net/src/optimize/predict.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"421c6f51eb74dfd6ec7c6712346f0dccbc092b821586424d292a7d44366b82e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_py/src/image.rs:146-155 | horus_py/src/pointcloud.rs:71-80 \u2014 before extracting anything, compare \u0060horus_py/src/image.rs\u0060 and \u0060horus_py/src/pointcloud.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 93 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 \u0060horus_py/src/image.rs:146\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":"horus_py/src/image.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad84427e5d1fbd9e20ff9c7c900df9a9529d4706caf24a5210afadd23e88e6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): horus_manager/src/commands/upgrade.rs:943-948 | horus_manager/src/source_resolver.rs:920-925 | horus_manager/src/source_resolver.rs:943-948 | horus_manager/src/source_resolver.rs:970-975 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/upgrade.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcbe0d2592e8e7c4cb8b8a4c420c730c9876cff9217328a2f8acdc1e001c240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): horus_manager/src/commands/topic.rs:405-410 | horus_manager/src/commands/topic.rs:460-465 | horus_manager/src/commands/topic.rs:477-482 \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 before the matched lines, \u0060horus_manager/src/commands/topic.rs:458\u0060 calls \u0060from_le_bytes\u0060, \u0060try_into\u0060, \u0060unwrap_or\u0060 and \u0060horus_manager/src/commands/topic.rs:404\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":"horus_manager/src/commands/topic.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee91600f666d20b677541b19541780cc535c9685afdcedb5bed73e58e770d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): horus_py/src/depth_image.rs:112-117 | horus_py/src/image.rs:152-157 | horus_py/src/pointcloud.rs:77-82 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/image.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 78 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 \u0060horus_py/src/depth_image.rs:112\u0060 it does not close everything it opens, so those exact 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":"horus_py/src/depth_image.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e794ae86b5835d7582778a2de7fe0675d5b73616e875af5431a26ea1beb4ce1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): horus_py/src/messages.rs:1958-1963 | horus_py/src/messages.rs:2103-2108 | horus_py/src/messages.rs:2265-2270 \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 \u0060horus_py/src/messages.rs:1958\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":"horus_py/src/messages.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c18b78b6e5a419d93cc5d16a5ef8a61884fb9d731563d9d6eefbab21839df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_core/src/communication/topic/dispatch.rs:1388-1393 | horus_core/src/communication/topic/dispatch.rs:1621-1626 \u2014 both copies are in the same file, so extract the block 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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84745c2210ccae0f09dea13986bf87a1bee746e15e3261177c137f87807f133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/deploy.rs:96-103 | horus_manager/src/toolchain.rs:27-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"846d70dc49c45f03dd6c06eaf6da0bd462c1ae3c7596a99612cfc7d4eec3d311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/doc_extract_rust.rs:177-182 | horus_manager/src/commands/doc_extract_rust.rs:265-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"249d09f02d5df79f9a5589591095e04c525de9b01222c59d28a422df011b7886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1278-1284 | horus_manager/src/commands/plugin.rs:492-498 \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 \u0060horus_manager/src/commands/pkg.rs:1278\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ea328b61e8a69135c02d81c03a17ed2c7ef009b7cb85b83cbf627c53350581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1772-1777 | horus_manager/src/commands/pkg.rs:1814-1819 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1772\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cc9401811f7fd72c92389eea67ec3d87101152d1c944d54bdd48b4480cbac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1845-1850 | horus_manager/src/commands/pkg.rs:1873-1878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1845\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"82553a130e472f8119896917d5dce29914cdaf812aedbfd87214b9e4eb21e862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/run/run_cpp.rs:444-449 | horus_manager/src/commands/run/run_cpp.rs:574-584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/run_cpp.rs:444\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c939f621099c7016fd78743624c4b9a0a303d8511d7901f387138d609c25d458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/tf.rs:1782-1787 | horus_manager/src/commands/tf.rs:2273-2278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/tf.rs:1782\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2d8cefb1751f8752ab5742c7232a2629aba65090f9d382dde4738a3d3f353d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/topic.rs:380-385 | horus_manager/src/commands/topic.rs:428-433 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/topic.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a253aa68227dec951266e3ef3ac5bcda0aeffca1024aca83324b5bb881836243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): horus_py/src/depth_image.rs:73-78 | horus_py/src/image.rs:116-119 | horus_py/src/pointcloud.rs:47-52 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/image.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 78 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 \u0060horus_py/src/depth_image.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_py/src/image.rs:119\u0060 calls \u0060getattr\u0060, \u0060extract\u0060 and \u0060horus_py/src/depth_image.rs:78\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":"horus_py/src/depth_image.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebb9e1332c6cbfcc96dabd125652026f87af6daff02dd894292e504772eceb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_sys/src/discover/linux.rs:97-102 | horus_sys/src/discover/windows.rs:226-231 \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 \u0060horus_sys/src/discover/linux.rs:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/linux.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5663212c2b8721a69b98f18093ec9879b718ae65762a93a15afac34354691eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_sys/src/discover/macos.rs:310-315 | horus_sys/src/discover/windows.rs:222-227 \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 \u0060horus_sys/src/discover/macos.rs:310\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/macos.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1022798bd300ce56961b70695f41db1bc163d63c3270d4b0ada79867ff9bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): horus_manager/src/commands/action.rs:532-536 | horus_manager/src/commands/blackbox.rs:371-375 | horus_manager/src/commands/launch.rs:593-598 | horus_manager/src/commands/log.rs:294-298 | horus_manager/src/commands/service.rs:488-492 | horus_manager/src/commands/topic.rs:237-241 | horus_manager/src/commands/topic.rs:1055-1059 | horus_manager/src/commands/topic.rs:1211-1215 | horus_manager/src/commands/topic.rs:1371-1375 \u2014 before extracting anything, compare \u0060horus_manager/src/commands/action.rs\u0060 and \u0060horus_manager/src/commands/service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_manager/src/commands/topic.rs:1063\u0060 calls \u0060read_topic_messages_total\u0060, \u0060unwrap_or\u0060 and \u0060horus_manager/src/commands/topic.rs:1218\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":"horus_manager/src/commands/action.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b336aee12747c678f2c2d24a3bcd8e292ae0916a97b2cd4f6a96b02bca15d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): horus_py/src/depth_image.rs:168-172 | horus_py/src/image.rs:256-260 | horus_py/src/pointcloud.rs:140-144 | horus_py/src/tensor.rs:397-403 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/image.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 78 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060horus_py/src/tensor.rs:411\u0060 calls \u0060clone\u0060, \u0060drop\u0060, \u0060borrow_mut\u0060 and \u0060horus_py/src/depth_image.rs:174\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":"horus_py/src/depth_image.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a30963f65100dc23d734faf639b81746962934003c0b13db799635ebdcb60f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): horus_manager/src/commands/doc_extract_rust.rs:348-352 | horus_manager/src/commands/doc_extract_rust.rs:393-397 | horus_manager/src/commands/doc_extract_rust.rs:433-437 \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 \u0060horus_manager/src/commands/doc_extract_rust.rs:348\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"085680466fbc33f527a78c5a7a835c420eefb4d20fbcd5d8b98b307d42f08a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): horus_manager/src/commands/pkg.rs:1280-1284 | horus_manager/src/commands/pkg.rs:1389-1393 | horus_manager/src/commands/plugin.rs:494-498 \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 \u0060horus_manager/src/commands/pkg.rs:1280\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bfa3f092c40550888746191d4fbecb5ce7df5acf0df04caff58860d4465187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_core/src/communication/topic/mod.rs:447-452 | horus_core/src/communication/topic/mod.rs:467-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/communication/topic/mod.rs:447\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfccb3d1411594c84cf2edd05e62c0e8f435b18892eab850981cc3c7aa73ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_core/src/core/log_buffer.rs:395-399 | horus_core/src/core/log_buffer.rs:860-864 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/core/log_buffer.rs:395\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/log_buffer.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dca29821b8635f5f7e76b85b5eb63bac6ee482fd1f447036fc8911179f7918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_core/src/drivers/mod.rs:253-258 | horus_core/src/drivers/mod.rs:429-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/drivers/mod.rs:253\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/drivers/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e12807681f9466bdd4c8de979118cf3bf3ffdc1c89f8ec4ca87b8800567cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/deploy.rs:489-495 | horus_manager/src/commands/deploy.rs:1226-1232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/deploy.rs:489\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"67507ca101f02b21e0139297558c5c2b5730aca7cde79629a04b6e019e8c52f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/doc_extract.rs:1183-1189 | horus_manager/src/commands/doc_extract.rs:1191-1197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract.rs:1183\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8f00010dac78ad6b38482e059213ade035ab3017c0f4ef3976258c11491b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/github_auth.rs:445-450 | horus_manager/src/commands/pkg.rs:2091-2096 \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":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7b91c99679cbbb269617a2a3089dbf5969010b1d35d6d7906192cf3411a45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): horus_manager/src/commands/github_auth.rs:522-537 | horus_manager/src/commands/github_auth.rs:631-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/github_auth.rs:522\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1b7ca23d75fbc62ebaaf03abf79b1445183e901799fd27680e11ee4656ddce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1078-1082 | horus_manager/src/commands/pkg.rs:2410-2414 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"01920cf2446aca3ed1955985796c61aeb620c4639357e8df7d9ccfc28a26ec70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/run/run_cpp.rs:413-419 | horus_manager/src/commands/run/run_cpp.rs:541-547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb0e75df87b2ac5f3f923a1ebbde6b44d7ec5fd360562e97868ff6dca001e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/commands/topic.rs:382-386 | horus_manager/src/commands/topic.rs:407-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/topic.rs:382\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4b3f49671066a471b52021875f5d37e8fa30cd2ca0aac9270e718a3153a70f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/registry/install.rs:1658-1662 | horus_manager/src/registry/install.rs:1926-1930 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a83e2af31e45fabbcaa279d499f4d704a3386cb69db405d46003b8ac7b2e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_py/src/depth_image.rs:84-89 | horus_py/src/image.rs:128-133 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/image.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 78 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":"horus_py/src/depth_image.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce4bac84762a9bbb06a0a384cd014b27080d3b9d7a99ce183a466a0fbb6fb3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_py/src/topic.rs:1130-1134 | horus_py/src/topic.rs:1218-1223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_py/src/topic.rs:1130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/topic.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63322661bec773e5be02958d22508666d4654ec6035b48ede593019c2c52f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_py/src/transform_frame.rs:766-778 | horus_py/src/transform_frame.rs:794-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/transform_frame.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f955d698a4d4f5b8d826b528de689e3e55eef33225a4efe62201f29f129232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_core/src/scheduling/rt_executor.rs:37-44 | horus_core/src/scheduling/safety_monitor.rs:210-217 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a57ae8092f270c3c8e3bf94c423c2dc6c46d45965ac6116188143d2690dd29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): horus_core/src/scheduling/rt_executor.rs:644-677 | horus_core/src/scheduling/safety_monitor.rs:184-200 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c1643cd0e754d3e532401c2d397a36d33a5152953c5a1ba27794544203ac16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): horus_manager/src/cmake_gen.rs:515-525 | horus_sys/src/shm/mod.rs:37-47 \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":"horus_manager/src/cmake_gen.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5363649d29f396a4b4b80fbdd1a42be40da79c1a427c08429afb30702f457fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/deploy.rs:105-112 | horus_manager/src/toolchain.rs:37-44 \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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9602e855e1a79e829486c2937a121001815b85380755a093f355e47fcdb99c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/deploy.rs:114-121 | horus_manager/src/toolchain.rs:47-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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a10187b60b8ce6342d8e1f1f3cd07f60c5f30c78b6b39daf53020d31ae8cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): horus_manager/src/commands/launch.rs:197-202 | horus_types/src/math.rs:25-30 | horus_types/src/time.rs:10-15 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/launch.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c102e53676c0b66be7f670371339fee8055cc664d6b7909fa4ab7501625680d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/msg.rs:973-980 | horus_manager/src/msgspec/canonical.rs:62-69 \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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9e0bfd6c271ba5fbb9bf323da3156c26723aff8d1cf825c40497734c08542b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_py/src/depth_image.rs:285-289 | horus_py/src/pointcloud.rs:259-263 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/pointcloud.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 92 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 \u0060horus_py/src/depth_image.rs:285\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/depth_image.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5079527f2ee7e29a6f9043f29f719b56013839cbe4c38a54254ae2336edcb8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_py/src/depth_image.rs:297-301 | horus_py/src/pointcloud.rs:271-275 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/pointcloud.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 92 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 \u0060horus_py/src/depth_image.rs:297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/depth_image.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2817e29a71e53ce71ddc89d723036347789096eb7da08307a82b7a6604fc5f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_py/src/perception.rs:407-412 | horus_types/src/math.rs:221-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060other\u0060 to \u0060\u0026PyPointXYZ\u0060 in one and \u0060\u0026Point3\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":"horus_py/src/perception.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"245dea805b7acce44a64a6f1a218302145dbe6deff104789b4b0abd617a74884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_py/src/perception.rs:561-565 | horus_types/src/math.rs:113-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060other\u0060 to \u0060\u0026PyLandmark\u0060 in one and \u0060\u0026Pose2D\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":"horus_py/src/perception.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de7f47b1beafd27d79529476bbe0641bc06c3509e09f2cf7f300577c1c707d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_core/src/memory/costmap.rs:317-324 | horus_core/src/memory/costmap.rs:340-347 | horus_core/src/memory/occupancy_grid.rs:168-175 \u2014 before extracting anything, compare \u0060horus_core/src/memory/costmap.rs\u0060 and \u0060horus_core/src/memory/occupancy_grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/costmap.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"37371008294685737cdf01011dfc327ee390932661353c4e8e0745c8220b1f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): horus_core/src/types/dtype.rs:82-92 | horus_core/src/types/image_encoding.rs:67-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/types/dtype.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"762141b9fe0ef7ed600622b238bcfbbffe0f92389f8540398085c3399f8d4748"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_cpp_macros/src/cpp_gen.rs:22-27 | horus_cpp_macros/src/cxx_gen.rs:39-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp_macros/src/cpp_gen.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea65dac7f4ea60ab3cc4b5234797274b54b2600449a99204b5a0f391a8e642b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): horus_core/src/memory/tensor_pool.rs:1568-1584 | horus_core/src/memory/tensor_pool.rs:1757-1772 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/memory/tensor_pool.rs:1568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2da9c2a5d42f102a8be136b88e4b204f0462444e01f843adb0769c820f7674"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): horus_manager/src/commands/check.rs:582-598 | horus_manager/src/commands/check.rs:668-684 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/check.rs:582\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/check.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf422229ad726d2e07312cfac224e8c343db5cc11f0b20a40e9c23e1b06912a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): horus_py/src/tensor.rs:648-660 | horus_py/src/tensor.rs:765-775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_py/src/tensor.rs:648\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/tensor.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b600a1f329ac4989896888c53e29e5e529fce7ed241c6f6da297873c322fc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/cmake_gen.rs:388-400 | horus_manager/src/cmake_gen.rs:465-474 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/cmake_gen.rs:388\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cmake_gen.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8e3ea5cb4dc051d3bee6f43f6565d3f06da541632042a1db15ae00a188b24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): horus_manager/src/registry/install.rs:1603-1615 | horus_manager/src/registry/install.rs:1791-1803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:1603\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad0f581b776e0d4199271d033e39f81913252fe900693f3d7f3cee2329b9713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): horus_py/src/scheduler.rs:242-253 | horus_py/src/scheduler.rs:391-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_py/src/scheduler.rs:242\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/scheduler.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8ccae023b0cb3bbfb038dffe11367ede41a4a22955f9f17c0149946c73aa95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): horus_manager/src/registry/publish.rs:882-893 | horus_manager/src/registry/publish.rs:969-977 | horus_manager/src/registry/publish.rs:992-1002 \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 \u0060horus_manager/src/registry/publish.rs:882\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc89692cd029583decac92ce7af8c5ea1d4f6e23edd70427aba2301fbc56bfea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): horus_sys/src/shm/macos.rs:226-237 | horus_sys/src/shm/macos.rs:253-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_sys/src/shm/macos.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_sys/src/shm/macos.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0979895fc560af95c5018591a19326df5f81eda1f2c1a67fa59bff026c5c17c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): horus_manager/src/registry/publish.rs:1022-1033 | horus_manager/src/registry/publish.rs:1047-1058 | horus_manager/src/registry/publish.rs:1100-1111 | horus_manager/src/registry/publish.rs:1125-1136 \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 \u0060horus_manager/src/registry/publish.rs:1022\u0060 it begins part-way through the construct above it, so those exact 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, \u0060horus_manager/src/registry/publish.rs:1021\u0060 calls \u0060json\u0060 and \u0060horus_manager/src/registry/publish.rs:1046\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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a73ff27628bd2299e76889df9ae84871c07fcff3378af529dab6ba9efc23bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): horus_py/src/image.rs:187-197 | horus_py/src/pointcloud.rs:81-91 \u2014 before extracting anything, compare \u0060horus_py/src/image.rs\u0060 and \u0060horus_py/src/pointcloud.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 93 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 \u0060horus_py/src/image.rs:187\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":"horus_py/src/image.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"36664bebfe02db9d9a3519c8f95b5034654998a5d7d0ed45caa387dcea39b08a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): horus_manager/src/commands/tf.rs:459-469 | horus_manager/src/commands/topic.rs:100-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/tf.rs:459\u0060 it begins part-way through the construct above it, so those exact 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, \u0060horus_manager/src/commands/topic.rs:97\u0060 calls \u0060dimmed\u0060 and \u0060horus_manager/src/commands/tf.rs:457\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":"horus_manager/src/commands/tf.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec0e688ef4be27158b12772a4e827fee5ec7c2fa034b668a4a18abe75dbc627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_sys/src/shm/macos.rs:211-220 | horus_sys/src/shm/macos.rs:267-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_sys/src/shm/macos.rs:211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_sys/src/shm/macos.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc09f9f7de04964f8f3f8c9d00db89fa037b49d6f2e59e95bbf68a25adea1337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/commands/run/run_cpp.rs:302-311 | horus_manager/src/commands/run/run_cpp.rs:336-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/run_cpp.rs:302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a407f0ee1460c4a5e4185579365f8db545f6efaf671f879ccda87fe2e0bb5f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_py/src/depth_image.rs:140-147 | horus_py/src/pointcloud.rs:105-114 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/pointcloud.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 92 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 \u0060horus_py/src/pointcloud.rs:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/depth_image.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"96db6f481bcc00dc8f183616596ebc01d1cada2ef7e732bd995d9758528e7948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/action.rs:539-548 | horus_manager/src/commands/action.rs:549-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/action.rs:539\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/action.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37c9638b49ffde2506da94daadf527127b4ef624b0c47450cc0e71585634262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): horus_sys/src/platform/mod.rs:210-219 | horus_sys/src/platform/mod.rs:245-254 | horus_sys/src/platform/mod.rs:270-279 \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 \u0060horus_sys/src/platform/mod.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/platform/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ac52199dd4de8b5ce37e2c3bdc6937883db6094d1eb03af87ce45781b4c54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_sys/src/fs/mod.rs:119-128 | horus_sys/src/fs/mod.rs:158-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_sys/src/fs/mod.rs:119\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":"horus_sys/src/fs/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d3afef490a4672771539f442ac19cd3933e8d73b52f5ffa88b9466d194aadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/main.rs:3202-3211 | horus_manager/src/main.rs:3233-3241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/main.rs:3202\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/main.rs"},"region":{"startLine":3202}}}],"partialFingerprints":{"codehealthFindingId/v1":"78220a593cdb918bf4a934e8a654c9ab0d8f71b78a88d790d294c930ff810ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): horus_manager/src/registry/publish.rs:1100-1109 | horus_manager/src/registry/publish.rs:1154-1163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/publish.rs:1100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe40a4b35395faf6b096917a6ca53e3dbe04665770c7208775aa238e20dfc4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/tf.rs:1636-1643 | horus_manager/src/commands/tf.rs:1937-1945 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/tf.rs:1636\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"horus_manager/src/commands/tf.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cf60803e47902e86b53d6448b5127ea9df92934e92c0b76835deb390ecad6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/upgrade.rs:996-1004 | horus_manager/src/commands/upgrade.rs:1032-1040 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/upgrade.rs:996\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/upgrade.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"6095602c7c4d9c1438ff13c10f7e623834d05ebacf2cc6ec96d21d04e095305f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/registry/install.rs:1634-1642 | horus_manager/src/registry/install.rs:1914-1922 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:1634\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"502e7435ab63f974dd38f96c598dcc2364de517c837270181a3d49192f74777f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/registry/helpers.rs:1571-1579 | horus_manager/src/registry/helpers.rs:1638-1646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/helpers.rs:1571\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa5b46d7b4273bc72d1c4980752086f20138f0d8a87d062cef8d4af637f4488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/registry/install.rs:892-900 | horus_manager/src/registry/install.rs:1981-1989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/install.rs:892\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e317f94c155ee8a019ab9f6e269c8b37748c9207a636c54884048c42b160a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_manager/src/commands/check.rs:908-916 | horus_manager/src/commands/check.rs:935-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/check.rs:908\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":"horus_manager/src/commands/check.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"14334467f7876f8e7ee10faf146b8df3145282f66ff93e34e923be0292c55ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): horus_core/src/testing/shm_fault.rs:251-259 | horus_core/src/testing/shm_fault.rs:280-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/testing/shm_fault.rs:251\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":"horus_core/src/testing/shm_fault.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f378a02fa7872374959bf4d32c80389fd4556ea7d520edc564afd8fe939d390f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): horus_py/src/depth_image.rs:139-147 | horus_py/src/image.rs:211-219 | horus_py/src/pointcloud.rs:104-112 \u2014 before extracting anything, compare \u0060horus_py/src/depth_image.rs\u0060 and \u0060horus_py/src/image.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 78 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":"horus_py/src/depth_image.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cdaa1be5495ad4223d477194cef61c72b78c572ad73fcbe8e8ce3c834e3b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/urdf.rs:44-51 | horus_manager/src/urdf.rs:64-70 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/urdf.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b2e5a6362775b254c59a3fdfbfa0fcf3a207892c90196113cf4560b0d53bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_manager/src/registry/publish.rs:1099-1106 | horus_manager/src/registry/publish.rs:1153-1160 | horus_manager/src/registry/publish.rs:1175-1182 \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 \u0060horus_manager/src/registry/publish.rs:1099\u0060 it begins part-way through the construct above it, so those exact 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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"035ee8c7a8fb1b322f782891ce5005d7447d6e3206e11bf64fb5db707ac51cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/main.rs:2580-2587 | horus_manager/src/main.rs:2714-2721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/main.rs:2580\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":"horus_manager/src/main.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1546e7d23ac1794fbcccecd2749420d9523274aabb0b47da5d862e46ec803a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/pkg.rs:1521-1528 | horus_manager/src/commands/pkg.rs:1576-1582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/pkg.rs:1521\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9788f89f12bdaf230135494f3cf12488bbbe28f90f1f5cec714bb54554d818ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/doc_extract_python.rs:168-175 | horus_manager/src/commands/doc_extract_python.rs:177-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_python.rs:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_python.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"54816018ac98c1e981a747aca1428cef7a14b343917de05fa5f12468231f0675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/cache.rs:271-278 | horus_manager/src/commands/deploy.rs:492-498 \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 \u0060horus_manager/src/commands/cache.rs:271\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/cache.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3183efba090402b9c7893d985bdc9d64140ddf6031daac4fc161c47663191b52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/registry/helpers.rs:843-850 | horus_manager/src/registry/helpers.rs:923-930 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacf04c8088f5feb29ddf8a3c0404b09ee1322f52d2c81330beb9bb79d5f65fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): horus_core/src/drivers/mod.rs:268-275 | horus_manager/src/commands/migrate.rs:237-244 | horus_manager/src/commands/migrate.rs:284-291 \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 \u0060horus_core/src/drivers/mod.rs:268\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/drivers/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f23fef512ce4a4f2c0655d4f5b71e4cd30cbee81925d9e612a6baebb087000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/registry/install.rs:1874-1881 | horus_manager/src/registry/install.rs:1930-1937 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/registry/install.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c700794d2ebf6abd4057ca142bbd8edc43ec4a5d15131a4adfd494ba29f838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/commands/doc_extract.rs:519-523 | horus_manager/src/commands/doc_extract.rs:593-600 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract.rs:593\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"693bc0d9b019f542a7c08170032d1e0eb89411c4389475a02e37d5e665ace580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/registry/publish.rs:1091-1098 | horus_manager/src/registry/publish.rs:1145-1152 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32fd256a3f917b5debf013b6c090c3d781b6da9259c767123a953c1d7c92813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/pkg.rs:2332-2339 | horus_manager/src/commands/scripts.rs:22-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"562cec6b29b452f720c56d225a7a07f7cfb78e2b19d938f9a5ef5af2498f9089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/doc_extract_python.rs:67-73 | horus_manager/src/commands/doc_extract_python.rs:172-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_python.rs:67\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_python.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"066be3c7a04b804e841ca22b4b364f4aef836221ee053383d9d8e88afcc0bfc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_macros/src/node.rs:443-449 | horus_macros/src/node.rs:455-461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_macros/src/node.rs:443\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89bc9593700ec2a8da973957ca75fa0d7d1363cdf2cd91b2d2b0cdaf1661a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/deploy.rs:1139-1145 | horus_manager/src/commands/deploy.rs:1265-1271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/deploy.rs:1139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0ff739eac46a36209dfe07069f58ed8632d117c761c5439512629ce5569d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): horus_manager/src/commands/blackbox.rs:440-445 | horus_manager/src/commands/cache.rs:271-277 | horus_manager/src/commands/deploy.rs:492-497 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. 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":"horus_manager/src/commands/blackbox.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac149ae6c4dffcf7f76c050c91c861c5e47432b1b29e80ddd87f316344c21b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/run/features.rs:172-178 | horus_manager/src/commands/run/features.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 \u0060horus_manager/src/commands/run/features.rs:172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/features.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea08071ad9747ce993031028532991eedd6970ca74a4f3bfbe7baa6ccd164ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/run/install.rs:436-442 | horus_manager/src/commands/run/install.rs:885-890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/run/install.rs:436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"861dafc30be5ccbed24c0faf595de79f26bf9c5849252ce3ff5ff4c8352d9315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/deps.rs:203-209 | horus_manager/src/commands/deps.rs:345-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/deps.rs:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deps.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c4180aa0e094d096346759bae0306559ce85e0e84738f0d23a026990961f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/upgrade.rs:1127-1133 | horus_manager/src/commands/upgrade.rs:1138-1144 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/upgrade.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c27c4b8a491cbec9422916f9b051b9de1c7028733eadd4dff54b6cd8bb3c334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/doctor.rs:968-974 | horus_manager/src/commands/doctor.rs:1867-1873 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doctor.rs:968\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"6320652c99ebd9f16488b0f53c5414e230564fb1d5b338d9b7cc507b70bb35d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): horus_manager/src/commands/msg.rs:445-451 | horus_manager/src/commands/msg.rs:573-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/msg.rs:445\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/msg.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25cc405ccd783a6076af8c3509d2128172b663634ac0c28de22da9efa35ad4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/doc_extract_diff.rs:89-94 | horus_manager/src/commands/doc_extract_diff.rs:107-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_diff.rs:89\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_diff.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8b706d185b294a7026e2af2cf6f7cd7e7c7fc25272a9fbfa6b27d6045dae0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_types/src/generic.rs:308-313 | horus_types/src/generic.rs:319-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_types/src/generic.rs:308\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/generic.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b58fcd3e2d338fd717b033f1529363abbb47d76addb0dde5b05cc1b6e4915b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): horus_core/src/scheduling/async_executor.rs:372-376 | horus_core/src/scheduling/compute_executor.rs:835-839 | horus_core/src/scheduling/event_executor.rs:484-488 | horus_core/src/scheduling/rt_executor.rs:1832-1837 \u2014 before extracting anything, compare \u0060horus_core/src/scheduling/async_executor.rs\u0060 and \u0060horus_core/src/scheduling/compute_executor.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 177 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 \u0060horus_core/src/scheduling/async_executor.rs:372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aabc61c6726b777f33965256e4bf549714834a2492ee423a4953f0d763e88b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_manager/src/commands/doc_extract_rust.rs:406-411 | horus_manager/src/commands/doc_extract_rust.rs:445-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/doc_extract_rust.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":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"78199721a0ab969a7219a3d0c4eb7edee58b3deb913ece9852bab4b2d306cc76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): horus_core/src/scheduling/rt.rs:190-195 | horus_core/src/scheduling/rt.rs:227-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/src/scheduling/rt.rs:190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6627a5b77fffeb559f7890c0b034719dcccc78b768b47e060da4ac22dbf2f7da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): horus_py/src/image.rs:440-444 | horus_py/src/image.rs:452-456 | horus_py/src/image.rs:464-468 | horus_py/src/image.rs:476-480 \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. 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":"horus_py/src/image.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b38b8cc1d4e5b590aa73c5e89981af7bc79f972a3f6b11f40d69569ec2ef3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/commands/node.rs:140-144 | horus_manager/src/commands/node.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":"horus_manager/src/commands/node.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c3175aca61b158df106d1cb28f95f89345f6760e80a6a925b4e630f463deeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/commands/plugin.rs:362-366 | horus_manager/src/commands/plugin.rs:389-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/plugin.rs:362\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/plugin.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a503c8d587651ed15b9ae233b38d320ada95239b4dc3de69e4c4be381c9aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/commands/tf.rs:2040-2044 | horus_manager/src/commands/tf.rs:2047-2051 \u2014 both copies are in the same file, so extract the block 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":"horus_manager/src/commands/tf.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"036ab836c901472554590475af9a25eab8fd9fe3ee6997386a9c99e947b1db37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/manifest.rs:1405-1412 | horus_manager/src/manifest.rs:1745-1752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/manifest.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":"horus_manager/src/manifest.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"548a9fc3feded990b256f3b67f31e67d2e06d339ec47c248a75faa38fcca85aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/plugins/discovery.rs:220-224 | horus_manager/src/registry/helpers.rs:697-701 \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 \u0060horus_manager/src/plugins/discovery.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/discovery.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bfc887c81e46306be53a274c227da79f43ec8d35c597eb0f4904e499b26e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_manager/src/registry/helpers.rs:96-100 | horus_manager/src/registry/helpers.rs:160-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/registry/helpers.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/helpers.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d98a05e8552fa2817268d1fbd5b41261807d94b98c63ba162d27efd9e9fe86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_py/src/params.rs:52-56 | horus_py/src/params.rs:63-67 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_py/src/params.rs:52\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/params.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f2f5715dbbf1617f6327ca2bf28fdcd46f7a7584c0c2cb217ea208c6bd964b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): horus_sys/src/discover/linux.rs:113-117 | horus_sys/src/discover/windows.rs:240-244 \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":"horus_sys/src/discover/linux.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"096333c81fe1449a33f97e804c4669ca73546a32edba0c1299e80fed62cd0f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_core/fuzz/fuzz_targets/fuzz_shm_header.rs:61-69 | horus_core/fuzz/fuzz_targets/fuzz_shm_header.rs:77-84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_core/fuzz/fuzz_targets/fuzz_shm_header.rs:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/fuzz/fuzz_targets/fuzz_shm_header.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1480f66d385abe3ca6057d13192fce3d93c8a36e2520a51ac1f14172b498c0de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): horus_manager/src/commands/test.rs:45-57 | horus_manager/src/commands/test.rs:66-73 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060horus_manager/src/commands/test.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/test.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9099f36e1ea82cf18b4d328d42f87e40e97eeb592c92d9cbe2665cf5950c3595"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: horus_sys: horus_sys: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"65a7f3814a31332b0ce66853454595919a7871bfac0d709ef3d67f69f0ded17c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NodeRegistration (LCOM4 6): NodeRegistration\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":"horus_core/src/scheduling/node_builder.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbc91943adcd1e1dec2a9ce2701936c7957c685b7b19de9efaddab5cd5a584d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PyNodeInfo (LCOM4 4): PyNodeInfo\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":"horus_py/src/node.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ec17b706cb89eb2ec1f31ba7cce31b2f3e157345456b73f03053a1a455b5a2"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: page loads with correct title: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"39122b3e3dfd868fc68c49718a2093e21cdaa2242893a626936773d6c80bc9ed"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: no console errors on page load: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62e2ba575f32bcb9f618f7b84e30f2c337d85c6fc71542593d25acfc7c8d928"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: status bar is visible: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7fe05b2c7c9ad821d5b750acf5e7a360a3d27f17c6cc80cebdc090b3c51d71"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: monitor tab exists: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"41725d29888e154777517d9f9372764af29dbe8824fc1c0a78f362a95e3b7245"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: API /api/status responds with JSON: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0010e2dac545db0b69f88de37ae879c62afb61636f5e384b56e232d21a03e851"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: API /api/nodes responds with valid JSON: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d40402dfe6096a7e8640a3b4eb27923e703a6a41766b59ee31e049eb7642556"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: API /api/topics responds with valid JSON: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ab8cb6b6a006f2cb286c218594b07b69ac662234768110ba5faf6a0ee07d6a"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: API /api/graph responds with nodes and edges: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d5aaa2d392146bbbc70c8c432d0466b2b3af9b91c831400fc55bf4ce7cd129"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: JavaScript functions loaded: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e047ad3a0e3156ffed6bf4f24e7757c7f6c24254c386c4178a67be84a2c118aa"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: page renders within 5 seconds: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d95b15b79dac22feb9d2ed91f426c1571df6c6f0b57f0fda44805994439164"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: Monitor tab is active by default: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45da85bb953f2892dc78046dcb9e5c3815153d71636db90466cd7ae3872b2bd"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: switch to Parameters tab: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"284a995128ee04683e98f25eebd5856446774a94e1bde6a251a3b27242d0250f"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: switch to Packages tab: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"becf24a362f2456b0ceb7327cb1b0c005263e89d50e25a7107dc0eacf9548b38"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: switch to API Docs tab: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b71f1fe9da1d6277b62072e229fa146da2a61a3bf4a1847c6e0ca8695a00200"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: switch back to Monitor tab: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6e7b0007cae1764a3b124efde55aa834599c364efe199cbec29e4cbf82a2d1"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: graph canvas exists and has dimensions: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f02368adee6f73f55bb9904d3740aa0ad99f1c6645c2e7f3587067549084ec"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: status bar shows node and topic counts: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b38b4ef9782f6c9aad1c35f0b2f04c02084d26842237a1e07556f4b737f477"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: empty state shows placeholder text: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12deebced45a5a8afab1fc17ac69b37a35e545582c7b38c81e9491fb07148e8"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: /api/status has required fields: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee4df7a932cc1840d7d5cd114cd962687be7bdabcda6179e0826978546d1ca2"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: /api/graph has nodes[] and edges[]: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f90f55e2f4f67c66039e871dc54cc4b2be523902b34313e5093dc9508893143"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: /api/params responds: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a60d43b96e365e8b2ffa75e11378e284c500ca5b996c9ef95105e022d8fd0ba"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: Parameters tab renders param content: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ef1d8b876f1798d2320bc73538fd0c006394896784c0e253da6e3c828ff8be"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: Packages tab renders content: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"763729801f37066149519fb06375570eaa1349cb37d8c0ac08bebab718368ae6"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: WebSocket connection attempt made: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ef131b09cffd7694fed1c02da9c9d18728b3e8da12780146c23dc4bc938742"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: updateAll function exists and is callable: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"490a126a838b2c7dca3ec8db4148726d5c753a0a79ec491c0b8d1943bbcb1a7a"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: no uncaught exceptions during tab switching: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1960fee07cc385f3aaf13b00a9b9823db3f0ce6c263478986d8b7c6d811cbd3a"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: API responses complete within 200ms: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed88607781c39f777ef9b4ed80c5ee167d64d56619835f6a421934b2c89cdb3"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: tab switch is fast (\u003C 2000ms for 4 switches): No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/tabs.test.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0590a9a96cfe998c8b282a14f7022f8d36b3a25f9fb88c6f9db7e231f8e138"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: capture screenshots at all viewports: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc8ef4c9f53b6eaf26c4ecd5e9111e99ca4b15f8ff932786db278310395172e"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: no horizontal overflow at laptop viewport: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba59e229ddd6fb9a3989be53ea70e8850f1201a99ada2daf577f29848035cd5"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: no horizontal overflow at mobile viewport: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae44091c51d255dcf60f33d5c91fa65dc26ef7f1c78b0df7e8927a2a3b249f2"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: reset viewport to desktop: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf79d0451938e9d19ca72ce0d0a56ed8ba078ff2cad52580f958fb5717e8b21"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: graph canvas is rendered (not blank): No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2981bc1f42c231ab00669f836e761ca4d527bcf78d5339a6cfeb5cf5693fad8"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: graph canvas element exists in DOM: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddbcb094c4843cb12479c9439d8c7556acd2ace8e6d1f1b561d71343dd53ed6"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: page load time-to-interactive \u003C 3s: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1306527bac7b2ca2bc7f32ac7c0f3abe9869b297e9b01db8dd7375381f8104"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: API /api/status latency \u003C 100ms: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba4807e9149db8082bea46fc33e2c20575102adfe756be7a0867be764fc02e2"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: API /api/nodes latency \u003C 100ms: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fe21be97259a15b99194589b613adaebc9f5efc97d07f22fc3b1f81292d9cc"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: API /api/graph latency \u003C 100ms: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb332773a93dfb6fe64fb58dfc7ae20714339f52fce5e3dffb42c76451588f73"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: 10 rapid API calls complete \u003C 500ms total: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c064e19df3091275fc1ad8508e8a0dc7a2b2a5b91a8ec192b9eded3f930953fe"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: dark theme colors are applied: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9911961be5232ffa4b16b4c860ba40bd12f47dd041ebb6910f646909b26f89"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: nav bar is visible and has items: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7a6b93f8438321564928de7e7d360aa1780ab61fc9618d09dd162b2fa3a65c"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: all tab content containers exist: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"323a96c71cd0d979577f13e54afb9abc896aa7fe27f49ac7a73232edf7fa9da8"}},{"ruleId":"D10","level":"note","message":{"text":"No direct assertions: all baseline screenshots saved successfully: No conventional assertion call was detected, and 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 read the same way \u2014 so this is treated as that project\u0027s convention rather than a broken test, and it does not drag the score. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a project of runnable samples compiled as tests, where a run that does not throw is the only check. If it is the latter, these methods genuinely verify nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/visual.test.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"794317a7456e69ef3c20e131588ab8b8ace01802a252d5c0c6101106ad7eea97"}},{"ruleId":"D10","level":"note","message":{"text":"Test project verifies nothing: horus_manager/tests/web_e2e: No conventional assertion call was detected in 43 of 43 tests in \u0060horus_manager/tests/web_e2e\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/web_e2e/basic.test.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8af2c1a218c6108608b245ce60ac43910d969f3f5cb7cb70f62f85c2dee1d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/main.rs: horus_manager/src/main.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 215 in horus_manager::run_command at line 2469. 9 of those changes were fix/bug commits, and the other 20 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/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":"horus_manager/src/main.rs"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5500c4c4b6bb91656fac9529fe54eab43a379baffaae0bf5d776fd24ed4dd470"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/scheduling/scheduler/mod.rs: horus_core/src/scheduling/scheduler/mod.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in Scheduler::run_with_filter at line 3212. 30 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/scheduler/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":3212}}}],"partialFingerprints":{"codehealthFindingId/v1":"37283a8bba314b43c37dbb3fcc236ece48b1f9eab147fcfaf72bead506a3ab64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/scheduling/rt_executor.rs: horus_core/src/scheduling/rt_executor.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in RtExecutor::tick_node at line 1417. 20 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/rt_executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"823fe41729a41c97ce418ca74b7ebd7e6ed99cc7c84d3691ecfd0c6e9edfbec4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/check.rs: horus_manager/src/commands/check.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in horus_manager::commands::check::check_manifest_file at line 1054. 6 of those changes were fix/bug commits, and the other 6 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/check.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":"horus_manager/src/commands/check.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34eb04efc97c1dc64dfd83e7f5c34746e1222b6cd8975ae7153cf79f49ecd81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/communication/topic/mod.rs: horus_core/src/communication/topic/mod.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RingTopic::negotiate_shm_header at line 1179. 28 of those changes were fix/bug commits, and the other 35 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/communication/topic/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd344b4ad2191a866655b6e303582b4be51f7a10a3e3527bfc42a8f605cd0ced"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/communication/topic/header.rs: horus_core/src/communication/topic/header.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in horus_core::communication::topic::header::read_slot_from_region at line 1828. 13 of those changes were fix/bug commits, and the other 20 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/communication/topic/header.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":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5404089e126304ae82429abe4163ac70b977738f923dadab36c2aaa15c9ca3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/communication/topic/dispatch.rs: horus_core/src/communication/topic/dispatch.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in horus_core::communication::topic::dispatch::send_shm_mp_serde at line 1742. 20 of those changes were fix/bug commits, and the other 23 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/communication/topic/dispatch.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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f5346bbfec6aa084aeca2cc20c2eef6a9aa5a6a58063f21b6e2d9a946ef135"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_net/src/replicator.rs: horus_net/src/replicator.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Replicator::process_packet at line 367. 14 of those changes were fix/bug commits, and the other 20 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/replicator.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":"horus_net/src/replicator.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfd9858b14771746f2a52098d15791e08beb754bbfe897ab43d437e80dfeab3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/scheduling/event_executor.rs: horus_core/src/scheduling/event_executor.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in EventExecutor::watcher_thread at line 284. 11 of those changes were fix/bug commits, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/event_executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/event_executor.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c042b00ef55c6a28d66ae297b2bdc209cea57592d4cb1c5d277abf0b2f8bd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/registry/install.rs: horus_manager/src/registry/install.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in RegistryClient::install_from_registry at line 399. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/registry/install.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":"horus_manager/src/registry/install.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f240a40ebdfc1615fde2a75b32f645f4ba74fa1ad33c49f2e89d9badeb10c08d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/scheduling/compute_executor.rs: horus_core/src/scheduling/compute_executor.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ComputeExecutor::compute_thread_main at line 567. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/compute_executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/compute_executor.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"4003edd9338c9ed002f365241161648c27f7fd48a5fb13109113bf8c530fe5c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/src/bin/cross_process_benchmark.rs: benchmarks/src/bin/cross_process_benchmark.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in horus_benchmarks::bin::cross_process_benchmark::main at line 2265. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/bin/cross_process_benchmark.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":"benchmarks/src/bin/cross_process_benchmark.rs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39606c4e5672385a44a79dffca8d1794d9d5c21f8f9548cfc2827e4aef2f9c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/scheduling/async_executor.rs: horus_core/src/scheduling/async_executor.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in AsyncExecutor::async_thread_main at line 114. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/async_executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80ec394fbd7590c5e9f8b58099ff8457aa11e2c7c478f12800690f8f559adee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/run/run_rust.rs: horus_manager/src/commands/run/run_rust.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in horus_manager::commands::run::run_rust::execute_build_only at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/run/run_rust.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/run_rust.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2563d5b90cafe9fb55ebacc4f159900399cbce53f63bd677a577f58b10970e57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/pkg.rs: horus_manager/src/commands/pkg.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in horus_manager::commands::pkg::run_add_dep at line 1042. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/pkg.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":"horus_manager/src/commands/pkg.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"56923f35d70802e9e9888ca7bd4a1bf00e6ec466c8678665d051de0e0287467f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/new.rs: horus_manager/src/commands/new.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in horus_manager::commands::new::create_new_project_with_options at line 35. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/new.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":"horus_manager/src/commands/new.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fa4f4703bd1f6de3c3afde53a7165c621484c186ccc097cf85511467356b2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/src/output.rs: benchmarks/src/output.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in BaselineHistory::compare_one at line 1007. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/output.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":"benchmarks/src/output.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"1738c8e5c7b452255a69140e195d3b6d26ada533be5111872cff6a65fd71971f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/scheduling/node_builder.rs: horus_core/src/scheduling/node_builder.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in NodeRegistration::validate at line 559. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/node_builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/node_builder.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"1208f63415faa5daf16bc356f5e77acb126cbf1122d0fb67d8129e18a6be5689"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/registry/publish.rs: horus_manager/src/registry/publish.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in RegistryClient::publish 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/registry/publish.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":"horus_manager/src/registry/publish.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebaf12f102344c556e506f483c9808fd54249968c34a8cbef3b43a7c7eb88a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/node.rs: horus_manager/src/commands/node.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in horus_manager::commands::node::list_nodes at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/node.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":"horus_manager/src/commands/node.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"054abbfffe0da80f8c95cf08121aa49ec7cbed42f0edbd2d825b45e346bd7f92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/doctor.rs: horus_manager/src/commands/doctor.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in horus_manager::commands::doctor::check_drivers at line 1226. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/doctor.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":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dc85a196d9f11f779dad28862824652005279fe265d693ef2d0ab5e97a5ae3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/run/run_cpp.rs: horus_manager/src/commands/run/run_cpp.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in horus_manager::commands::run::run_cpp::build_cpp at line 140. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/run/run_cpp.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":"horus_manager/src/commands/run/run_cpp.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecf891b4afc0531f7cf40d30ea66ee47b9022ed6551154795a0942d31ed4878"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/scheduling/primitives.rs: horus_core/src/scheduling/primitives.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in horus_core::scheduling::primitives::apply_degradation_action at line 320. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/primitives.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":"horus_core/src/scheduling/primitives.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1201c27161b12f949527e12cdba23e543fa5c463027f73875eceae6cef64f7e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_py/src/topic.rs: horus_py/src/topic.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PyTopic::recv at line 1267. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_py/src/topic.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":"horus_py/src/topic.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b62d80ff9d6c10caf104f218068e724aa86da1fe5b62b583305d7198b61987"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_net/src/presence.rs: horus_net/src/presence.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in PresenceReceiver::handle_broadcast at line 147. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/presence.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":"horus_net/src/presence.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67916255987a4c0cc0846094b1d7e997406204ada144af4e48eed1b000fba3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/services/server.rs: horus_core/src/services/server.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in horus_core::services::server::run_server_loop at line 184. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/services/server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/services/server.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a9b032ac132dec199324edcd148198aedacafe86e2b2a70315086352e47371"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/msg.rs: horus_manager/src/commands/msg.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in horus_manager::commands::msg::generate_messages at line 3043. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/msg.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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"d312797ce5d23fb03128fa6a64ab21638625ad489c5e6e3d62baa1f8cc7f99fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/run/mod.rs: horus_manager/src/commands/run/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in horus_manager::commands::run::execute_multiple_files at line 536. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/run/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b492ed61e214eb5abbf6a3d26e4da55b8acacf992921980523f068ee02ab08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/communication/mod.rs: horus_core/src/communication/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in horus_core::communication::write_topic_slot_bytes at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/communication/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d215e629724df187aa142519e9b2ab0fdb84f7f1bd4e0b932589751d0b016212"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/topic.rs: horus_manager/src/commands/topic.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in horus_manager::commands::topic::topic_hz 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/topic.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":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb79cd65c8b8a86bb8478cdb3f588b444fc3d1bbefd787c50eee12a7e0dfa8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_sys/src/discover/mod.rs: horus_sys/src/discover/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in horus_sys::discover::find_topics at line 317. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_sys/src/discover/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/discover/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ffdc67d673e0a720b48f7ded676181ec6474b23bc51879e50ccc3417650baa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/run/install.rs: horus_manager/src/commands/run/install.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in horus_manager::commands::run::install::install_pip_packages at line 235. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/run/install.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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f390591cf87b3f8779148bde6a944021c71a75d6ca1b4b3205cd010ec0b0c08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/src/bin/all_paths_latency.rs: benchmarks/src/bin/all_paths_latency.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in horus_benchmarks::bin::all_paths_latency::bench_mpmc_same_proc at line 1030. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/bin/all_paths_latency.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":"benchmarks/src/bin/all_paths_latency.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b317bbe06f0cca62d62ea387f0131ceeb52335c8fcfa3e9b604949805ab5efe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/core/rt_config.rs: horus_core/src/core/rt_config.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in RtConfig::apply at line 221. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/core/rt_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":"horus_core/src/core/rt_config.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b5166514752a25ef53cfe7f2b1508581dd2ac4ab3ef01a623d15c6e8a61908"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/discovery/nodes.rs: horus_manager/src/discovery/nodes.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in horus_manager::discovery::nodes::discover_nodes_uncached at line 3. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/discovery/nodes.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":"horus_manager/src/discovery/nodes.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa76e8268f78d9024eafdd6035ae71efee7358ddbb62f0bc01a21522dc744d29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_cpp/src/action_ffi.rs: horus_cpp/src/action_ffi.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in horus_cpp::action_ffi::action_server_process at line 419. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_cpp/src/action_ffi.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":"horus_cpp/src/action_ffi.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f269746cd247f5d12473ca13f5c404c55806e8aa6a167fc9780c5b9b8e8df6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/error_wrapper.rs: horus_manager/src/error_wrapper.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in horus_manager::error_wrapper::cargo_error_hint at line 236. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/error_wrapper.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":"horus_manager/src/error_wrapper.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e493bd5dbb31bc82c5d316e579ba36da37ce0c5593be8f42a50f0b1b7d0ea4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_core/src/scheduling/rt_report.rs: horus_core/src/scheduling/rt_report.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in RtReport::generate at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/rt_report.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":"horus_core/src/scheduling/rt_report.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc0aa5f69269009538a3c244f125fb3acb17923f7ee71813e087f9c37d5f833"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/clean.rs: horus_manager/src/commands/clean.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in horus_manager::commands::clean::run_clean at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/clean.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":"horus_manager/src/commands/clean.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e921ed8538ef696caf7f6ac3ad31faf5dc2a9e7020ef8fa0b0f5d22d5d67508"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/src/bin/topic_probe.rs: benchmarks/src/bin/topic_probe.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in horus_benchmarks::bin::topic_probe::main at line 614. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/bin/topic_probe.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":"benchmarks/src/bin/topic_probe.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"f392df105b1a3fc3750f912c7c1646ac3cf156f240836a0a3f1bc6a23ba62ff8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/test.rs: horus_manager/src/commands/test.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in horus_manager::commands::test::run_python_tests at line 423. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/test.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":"horus_manager/src/commands/test.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd0289e50bdbe98a7a3b82994d14b3269533bc2e996520691ae560583d65d80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/action.rs: horus_manager/src/commands/action.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in horus_manager::commands::action::send_goal at line 442. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/action.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":"horus_manager/src/commands/action.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e276c473dcb6b14431556804a5398df6fd0c4008e43b2033bacf27d8afa1f57b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/src/bin/determinism_benchmark.rs: benchmarks/src/bin/determinism_benchmark.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in horus_benchmarks::bin::determinism_benchmark::run_determinism_benchmark at line 230. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/bin/determinism_benchmark.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":"benchmarks/src/bin/determinism_benchmark.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c4b406ec15d0e69c296febba194f1c2eac4b04a0c8703c1801fc463e3abafd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_manager/src/commands/lint.rs: horus_manager/src/commands/lint.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in horus_manager::commands::lint::build_lint_commands at line 48. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/lint.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":"horus_manager/src/commands/lint.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd21097aee7e7b3ad7106a45d72a9358dedab4947d33bf2c7da7950b8a40432"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: horus_py/horus/msggen/builder.py: horus_py/horus/msggen/builder.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in builder.build_messages at line 99. 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-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_py/horus/msggen/builder.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":"horus_py/horus/msggen/builder.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb12406b6215a923a88749488227d342f889fa566972903f899fe932a82e27d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/memory/tensor_pool.rs: horus_core/src/memory/tensor_pool.rs changed 32 times in last 90 days and 19 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is TensorPool::alloc at line 1214), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pool): a truncated pool file must error, not SIGBUS the robot (#143)\u201D; \u201Cfix(pool): reclaim a tensor pool whose creator died before writing its header\u201D; \u201Cfix(shm): stop unmapping a region that sibling Topic clones still point into\u201D; \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/memory/tensor_pool.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":"horus_core/src/memory/tensor_pool.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"533c7ed516a22d10942b82f248cca7ebda6a0ed2974dc5bc90473151eea78704"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_sys/src/shm/mod.rs: horus_sys/src/shm/mod.rs changed 26 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is horus_sys::shm::cleanup_stale_namespaces_in at line 1693), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: fold duplication batches 5-7 (#200, #201, #202) into one CI cycle (#204)\u201D; \u201Cfix(bench,sys): read NaN back, and stop asserting Unix on Windows\u201D; \u201Cfix(shm): reclaim abandoned regions inside a namespace that is still in use\u201D; \u201Cfix(shm): stop unmapping a region that sibling Topic clones still point into\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_sys/src/shm/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/shm/mod.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce54e085f85d9114ed1ef2f0af173ae737f1b169517ef9e7f17a3dfccdd6ee98"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_net/src/estop.rs: horus_net/src/estop.rs changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is horus_net::estop::handle_remote_estop_at at line 197), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(net): an e-stop that reached nobody was indistinguishable from one that worked\u201D; \u201Cfix(net): a diagnostic on a broken stderr killed the replicator thread\u201D; \u201Cfix(security): require authentication for remote estop (#71)\u201D; \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/estop.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":"horus_net/src/estop.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10711e66e7f6f138d1ed673f0c55fde5baf5ee93784c840d74f49fd42b78e99"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/actions/server.rs: horus_core/src/actions/server.rs changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is ActionServerNode::tick at line 1283), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ci): repair every failing workflow (#84)\u201D; \u201Cfix(core,sys,cpp): a print on a broken stream killed the thread printing it\u201D; \u201Cfix(services,actions): a panic in user code no longer kills the server\u201D; \u201Cfix: goal_timeout bounded nothing, cancel_goal cancelled nothing, and replay wrote to a filename deleted in March\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/actions/server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/server.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa63bf53b450b4a9707d5f05b8b72a05a2d6e71a06145dc2320340dc6d0a17c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/error.rs: horus_core/src/error.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is HorusError::severity at line 1236), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ci): repair every failing workflow (#84)\u201D; \u201Cfix(ci): repair every failing workflow\u201D; \u201Cfix(rt,build,sim): stop hiding real-time degradation, cargo warnings, and sim-mode intent\u201D; \u201Cfix(errors,manifest): stop printing errors twice; report unknown horus.toml keys\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/error.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":"horus_core/src/error.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a205a67db658d3cf0a00b6a0716f85eef64de4fb435c071c2c5e18220189508"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_manager/src/commands/github_auth.rs: horus_manager/src/commands/github_auth.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is horus_manager::commands::github_auth::wait_for_oauth_callback at line 181), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(registry): stop shipping a registry URL that answers 503 (#175)\u201D; \u201Cfix(manager): the CLI printed instructions naming commands it does not have\u201D; \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D; \u201Csecurity: fix a regression in the e-stop framing fix, and close the OAuth state bypass\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/github_auth.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":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd762ee20937d25ed9a603d29ca2faed428d9cf8990ede5873e16f75b81ea96"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_net/src/peer.rs: horus_net/src/peer.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is PeerTable::find_duplicate_publishers at line 224), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(ci): repair every failing workflow (#84)\u201D; \u201Cfix(net): a diagnostic on a broken stderr killed the replicator thread\u201D; \u201Cfix: the loss throttle keyed on our own peer id, and log drains compared a node tick to a buffer index\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/peer.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":"horus_net/src/peer.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11ffad48d57f0e27f02eaf2b9ab1bc26b7fc6f192f777b5f7fc36ab1307570c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_sys/src/shm/linux.rs: horus_sys/src/shm/linux.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ShmRegion::new at line 95), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(topic): a lost FanoutShm attach no longer strands a subscriber forever\u201D; \u201Cfix(shm): stop unmapping a region that sibling Topic clones still point into\u201D; \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(shm): a publisher restart no longer deafens its subscribers\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_sys/src/shm/linux.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":"horus_sys/src/shm/linux.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b941fa0a2748fd9f8e767f63dd6f04025a4a17a77c4cbfa9e97ed5296cb5ad7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/scheduling/scheduler/recording.rs: horus_core/src/scheduling/scheduler/recording.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Scheduler::replay_from at line 117), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(rt): throttle the per-tick diagnostics that were destroying the log\u201D; \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D; \u201Cfix(ci): repair every failing job on main\u201D; \u201Cfix(replay): derive synthetic replay tick period from recorded wall-clock span\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/scheduler/recording.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":"horus_core/src/scheduling/scheduler/recording.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b5e610c55188dd07544cbf94a967de9d4056a3341ff11a29bfd295ebfae0d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/scheduling/record_replay.rs: horus_core/src/scheduling/record_replay.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is horus_core::scheduling::record_replay::diff_recordings at line 1214), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix clippy warnings that fail the strict gate on main\u201D; \u201Cfix CI and cross-platform tests\u201D; \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D; \u201Cfix(ci): clear all remaining rustdoc and clippy errors\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/scheduling/record_replay.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":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b92c4e070e7ed0ddbf8cdcd491874e1854e066dd157376425b32b9a4b09c496"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_sys/src/shm/fallback.rs: horus_sys/src/shm/fallback.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ShmRegion::new at line 74), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: three more drifted duplications from the audit (#195)\u201D; \u201Cfix(shm): stop unmapping a region that sibling Topic clones still point into\u201D; \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(ci): repair every failing workflow (#84)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_sys/src/shm/fallback.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":"horus_sys/src/shm/fallback.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7a0394b3c7d056829647187e1b1e9899121be26c15f7f2e1b158859d4b59df"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_sys/src/shm/macos.rs: horus_sys/src/shm/macos.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is ShmRegion::new at line 162), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shm): stop unmapping a region that sibling Topic clones still point into\u201D; \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(ci): repair every failing workflow (#84)\u201D; \u201Cfix: observe freshness through native shared memory\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_sys/src/shm/macos.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":"horus_sys/src/shm/macos.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3509927eeb220a081079d2f64ef760902228c4427508f957a80be5ba941f8eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: benchmarks/src/bin/iceoryx2_comparison.rs: benchmarks/src/bin/iceoryx2_comparison.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is horus_benchmarks::bin::iceoryx2_comparison::bench_cross_process at line 554), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(ci): repair every failing workflow (#84)\u201D; \u201Cfix(ci): repair every failing workflow\u201D; \u201CFix integration/bench/loom tests for SHM-only backends\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/bin/iceoryx2_comparison.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":"benchmarks/src/bin/iceoryx2_comparison.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"372845fb5e21d91bcbb6a3d908148ea9dcaf6de8be6eead6d54187b460e7ff95"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/core/log_buffer.rs: horus_core/src/core/log_buffer.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is horus_core::core::log_buffer::log_drain_loop at line 687), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(core,sys,cpp): a print on a broken stream killed the thread printing it\u201D; \u201Cfix: the loss throttle keyed on our own peer id, and log drains compared a node tick to a buffer index\u201D; \u201Csecurity: make the SHM tree owner-only and fix the JSON gateway file handling\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/core/log_buffer.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":"horus_core/src/core/log_buffer.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105089ffc5446c17a560c1d4ecf028be94e05ebd6add981e57523ccf7af5eba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/core/presence.rs: horus_core/src/core/presence.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is NodePresence::read_all at line 521), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: three more drifted duplications from the audit (#195)\u201D; \u201Cfix(core): reading local presence deleted the fleet\u0027s remote host records\u201D; \u201Cfix(core,sys,cpp): a print on a broken stream killed the thread printing it\u201D; \u201Cfix(scheduler): a node name can no longer forge lines in the runtime\u0027s output\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/core/presence.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":"horus_core/src/core/presence.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b642a54c3422bf14001b8ef7dd33af787386059602c4e24c113df45d595c1d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_manager/src/plugins/executor.rs: horus_manager/src/plugins/executor.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is PluginExecutor::discover_plugin_binary at line 135), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(manager): the CLI printed instructions naming commands it does not have\u201D; \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D; \u201Cfix(ci): repair every failing job on main\u201D; \u201Cfix(security): gate plugin execution on out-of-repo trust (SEC2 \u002B SEC3)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/plugins/executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/executor.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e907e48fb7b11c6f66f923e4a46b5952fb30a3b520efa6735553770f73f196a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/drivers/mod.rs: horus_core/src/drivers/mod.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is horus_core::drivers::load_from at line 152), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(core,py): deterministic mode was not deterministic, and astype always panicked\u201D; \u201Cfix(rt,build,sim): stop hiding real-time degradation, cargo warnings, and sim-mode intent\u201D; \u201Cfix(ci): clear all remaining rustdoc and clippy errors\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/drivers/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/drivers/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aa14ce7cc59b37a3dc3abcb3e4a0d49f0d3d86d3594377f1fbfcc496f9f82b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_net/src/shm_writer.rs: horus_net/src/shm_writer.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is ShmRingWriter::open_path at line 77), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(horus_net): the SHM import writer ignored the region\u0027s layout kind (#190)\u201D; \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(ci): clear all remaining rustdoc and clippy errors\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/shm_writer.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":"horus_net/src/shm_writer.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"19959e1e7cd700a32273dfd626333a23ddb15e303208c5b663d251b506c95760"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_py/src/messages.rs: horus_py/src/messages.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is PyPointField::new at line 6564), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D; \u201Cfix(ci): repair every failing job on main\u201D; \u201Cfix(security): patch RustSec vulns \u002B migrate pyo3 0.27-\u003E0.29 (closes Dependabot #25-#28)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_py/src/messages.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":"horus_py/src/messages.rs"},"region":{"startLine":6564}}}],"partialFingerprints":{"codehealthFindingId/v1":"445772c955ae5bb3f86312ae902bbaaca96c4a3db13462c17d7b3a38cf72f9d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_manager/src/commands/deploy.rs: horus_manager/src/commands/deploy.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is horus_manager::commands::deploy::run_deploy_multi at line 355), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(deploy): ship the binary, build the right manifest, expand the remote tilde\u201D; \u201Cfix(ci): unbreak all eight build workflows after the rust-major bump (#76)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/deploy.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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7be9cd1a671b163b32841fbef4a36e9f6895dfadddf39109e18a56d67ccb47d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/memory/shm_region.rs: horus_core/src/memory/shm_region.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ShmRegion::grow at line 146), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(topic): a lost FanoutShm attach no longer strands a subscriber forever\u201D; \u201Cfix(shm): stop unmapping a region that sibling Topic clones still point into\u201D; \u201Cfix(ci): repair every failing workflow (#84)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/memory/shm_region.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":"horus_core/src/memory/shm_region.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fe95b9f637d571dab82246fc27482be32cb87ea051fa54488ec52fba99cef8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: benchmarks/src/stats.rs: benchmarks/src/stats.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is NormalityAnalysis::analyze at line 479), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bench): run_variance was the null, and Windows has no clock_gettime\u201D; \u201Cfix(bench,sys): read NaN back, and stop asserting Unix on Windows\u201D; \u201Cfix(ci): repair every failing workflow (#84)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/stats.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/stats.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8236cf6fbcbd032e34ce7dc404f47ea59aef0a0571e091c768cd6b4aae58143e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_core/src/memory/rt_allocator.rs: horus_core/src/memory/rt_allocator.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is RtAwareAllocator::alloc at line 395), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ci): repair every failing workflow (#84)\u201D; \u201Cfix(core,sys,cpp): a print on a broken stream killed the thread printing it\u201D; \u201Cfix(rt): stop per-tick alloc\u002Bleak in .no_alloc() instrumentation; prove hot path\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_core/src/memory/rt_allocator.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":"horus_core/src/memory/rt_allocator.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"65048190add065253850f5a22c098f21cdd75a2d4b862c37656300b70a870987"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_net/src/heartbeat.rs: horus_net/src/heartbeat.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is SafetyHeartbeat::tick at line 223), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ci): repair every failing workflow (#84)\u201D; \u201Cfix(net): a diagnostic on a broken stderr killed the replicator thread\u201D; \u201Cfix(net): a peer was declared link-lost before it could answer\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/heartbeat.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":"horus_net/src/heartbeat.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f60d0dd8c905623efc6401a6b25da9bd6e3ecfb5e92e58521c2349b65dac5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_sys/src/process/mod.rs: horus_sys/src/process/mod.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is ProcessHandle::signal at line 130), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ci): repair every failing workflow (#84)\u201D; \u201Cfix(ci): repair every failing workflow\u201D; \u201Cfix CI and cross-platform tests\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_sys/src/process/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/process/mod.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeb8b62f658cdf7e5bfbf010663474072a9a292d115424d47512c94f8c6e5c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_net/src/mac.rs: horus_net/src/mac.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is Sha256::update at line 132), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(net): a diagnostic on a broken stderr killed the replicator thread\u201D; \u201Cfix(security): require authentication for remote estop (#71)\u201D; \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/mac.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":"horus_net/src/mac.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3db3ebe6a13d8e2f15f1946f9143ee16c7077a34d0fae2677e76a125d09572"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_manager/src/discovery/topics.rs: horus_manager/src/discovery/topics.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is horus_manager::discovery::topics::compute_topic_status at line 172), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: fold duplication batches 5-7 (#200, #201, #202) into one CI cycle (#204)\u201D; \u201Cfix(manager): \u0060topic list\u0060 called every topic active, including empty ones\u201D; \u201Cfix(manager): \u0060horus service list\u0060 reported 0 servers for a serving service\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/discovery/topics.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":"horus_manager/src/discovery/topics.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a92558431d34d2da3c00f0d7aa70e7bdc47a8ea28f597d3ab8030eed042370"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_manager/src/source_resolver.rs: horus_manager/src/source_resolver.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is PackageSourceResolver::resolve at line 61), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(registry): stop shipping a registry URL that answers 503 (#175)\u201D; \u201Cfix(ci): repair every failing job on main\u201D; \u201Cfix(manager): route dual-listed packages by project language (F6)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/source_resolver.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":"horus_manager/src/source_resolver.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5076f8b1bc8b12e41a678f3757819e2a1d5cd2c66fc63bcbd8fb5c504dc69668"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_manager/src/commands/service.rs: horus_manager/src/commands/service.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is horus_manager::commands::service::list_services at line 120), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(manager): the CLI printed instructions naming commands it does not have\u201D; \u201Cfix(manager): \u0060horus service list\u0060 reported 0 servers for a serving service\u201D; \u201Csecurity: make the SHM tree owner-only and fix the JSON gateway file handling\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/src/commands/service.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":"horus_manager/src/commands/service.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c20f44d63429d8fe39a968d2fa86bd8e7cb6b7110ef55afe2b2cbbb92d5a1df"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_manager/src/config.rs: horus_manager/src/config.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is horus_manager::config::resolve_registry_url at line 75), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: three more drifted duplications from the audit (#195)\u201D; \u201Cfix(registry): stop shipping a registry URL that answers 503 (#175)\u201D; \u201Cfix(ci): unbreak all eight build workflows after the rust-major bump (#76)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_manager/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":"horus_manager/src/config.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e27be9df6135922962357d7c48ad22ed640f302ae02f5c649479f281f51f0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: benchmarks/src/bin/competitor_comparison.rs: benchmarks/src/bin/competitor_comparison.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is horus_benchmarks::bin::competitor_comparison::bench_horus at line 119), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix(security): resolve dependency and workflow alerts (#70)\u201D; \u201Cfix: goal_timeout bounded nothing, cancel_goal cancelled nothing, and replay wrote to a filename deleted in March\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- benchmarks/src/bin/competitor_comparison.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":"benchmarks/src/bin/competitor_comparison.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"11470b746dbfbeff7c1e734f35197a41e877c99241d009c00f32b687525ade1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_net/src/flow_control.rs: horus_net/src/flow_control.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is FlowController::on_received at line 107), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cperf\u002Bfix: round 3 measurement honesty, security audit remediation, benchmark cleanup\u201D; \u201Cfix: the loss throttle keyed on our own peer id, and log drains compared a node tick to a buffer index\u201D; \u201Csecurity(horus_net): frame e-stop broadcasts, fix the import type check, bound wire-keyed maps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/flow_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":"horus_net/src/flow_control.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4accc60d51e6f611e4109bbcf60a386b814d58fe5fa86de03ee452f5f0aa59"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_net/src/netfilter.rs: horus_net/src/netfilter.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is PeerFilter::parse at line 140), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(net): a diagnostic on a broken stderr killed the replicator thread\u201D; \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D; \u201Csecurity(horus_net): frame e-stop broadcasts, fix the import type check, bound wire-keyed maps\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_net/src/netfilter.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":"horus_net/src/netfilter.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"04beaa031905ddf4384f4543e0b19f17a3113966bcd1b1d87522157cd1759c35"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: horus_sys/src/fs/mod.rs: horus_sys/src/fs/mod.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is horus_sys::fs::harden_existing_dir at line 352), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: the new ownership check compiled out on macOS, so hardening would chmod any directory\u201D; \u201Csecurity: \u0022secure\u0022 directory creation never repaired an existing mode, and the Rust action server had the C\u002B\u002B duplicate-goal bug too\u201D; \u201Cfix(test): the other dev_null existence assertion\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-30 09:28:58 \u002B00:00\u0027 --until=\u00272026-09-28 09:28:58 \u002B00:00\u0027 --full-history --no-merges -- horus_sys/src/fs/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/fs/mod.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f498c844fa742200c8563cfc054f3493714936054b4e798e7b474cd8cb91836e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \u2500\u2500\u2500 TODO Scanner \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c5cc9ec4229f0711480836e80b5fad53dc012c93ce37c7c3d96dfa28c7c0ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \u2500\u2500\u2500 TODO Scanner \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77b65be4434a4a645b8abd342708526e0d6205af4c781be1f6eb334da0fc81c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add calibration support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bb9fd5dea6c94460aa0ad289819aa46ae58d8990a81c68f698da847cd2b219"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO captured \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7060f0545102c530327d55928bb72cdff4bc4f0b1f0053809eaccfb326c845f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO captured \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_python.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54243c5dad9d52764e005b1aca82a2592dd552e7d36fa5714bead1ce4a0ff82"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refactor this module later \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f8abb5b4b0ab2df309612a6ede4e5036d0ed55d8d79bd60034caa2940f9030"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// # TODO: what would let the tail be gated directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/output.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20423ae88e50ab9c22731be2cbd7deb93271a5f64d7f4f35266cac514a6ceae"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060horus_manager/Cargo.toml\u0060 makes this repository a deployable product (line 26)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/Cargo.toml"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd9881468fe4b49d42d1d02c4fedc0e88d10c4cf5acecc431af07001e54701d"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060horus_manager\u0060 (121189 LoC, 270 module-visible types across 8 directories) overshoots its size bounds. 3 of 11 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 4.5/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de16dcc832aaa5f5b7441bd82e2cfcd375fdd351cecc68c752b09c0711d37f44"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060horus_core\u0060 (112714 LoC, 270 module-visible types across 13 directories) overshoots its size bounds. 3 of 11 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 4.5/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbdadfdbe7106d153869e1c101160377ccdf78cf6e649032b8cf8999f2df32f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060horus_py\u0060 (21565 LoC, 136 module-visible types across 5 directories) overshoots its size bounds. 3 of 11 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 4.5/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2901f3c5e8d0e1579b1c95013f951a0dd5f2b108f9c623216773c691bfa518"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0b6035681facf15306f6eb9e49da8e74ccf540aa1d1638315cf52216c08b79f"},"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":"7f28ae650da6b505a35e19db11a69119126530350e5bf73c4156e0a1e7330965"},"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":"ea99140f64acdafaec6d1bd1aa1a6ac5c2abd5340641ab78308284efbe79a163"},"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":"482e3b19efd040fb2215efbc5e65f5b9996234817368c5a9198eb89910e46231"},"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":"91c67e181b6c37a693165d1a8035eab5d54a5f5db10e1b803688dac313750c59"},"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":"13190b79613e4064484d3026e9dc139b398fd180413b77a435c1173805c6022d"},"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":"13ba9c00ec67eff020de9409c67c350b674a68ac1484a67ad7a219a71ff9893e"},"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":"d0fe89687743de11f571be9a34bc82adbf5da4a43eb4370cb5a0ac94f4faf623"},"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":"c2c82eed42964478b6afc9dcf4d933e4bbf07952a53f7d03d5674741d1f39230"},"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":"d4b60c43f40940cb975be827a383733864d27da2e9ac7e5114478aacfc63c973"},"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":"e4bcffe9cb0c6db6204298a0607a61859b4fc4d38569ef558e78188d801dd1dc"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef8ac436f36ed7338e526fa19126d76e96de4eeda1268c4ed23f18de64f7d6db"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7fe6cdbb121d51d876e0b2f60f9a2604ec537e94f98ac4508ea8dc86679297b7"},"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":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","severity":"medium","relation":"direct","declaredRange":"1.3","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"direct","declaredRange":"1.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"severity":"medium","fixedVersion":"0.11.18","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"],"severity":"medium","fixedVersion":"0.23.46","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"0.103.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","relation":"direct","declaredRange":"1.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.14.0","advisory":"RUSTSEC-2026-0391","severity":"medium","fixedVersion":"0.14.3","relation":"direct","declaredRange":"0.14","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0395","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0396","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0397","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0399","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0400","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0401","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0402","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0404","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0405","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0406","severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"8.0.0","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"severity":"medium","fixedVersion":"8.2.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.1.0\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","severity":"medium","fixedVersion":"2.1.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6436042135f6b167ba917eaeffeda9ff2746b5119992f2561f10ac645eb9925"},"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":"1f3de5ef0b48ca1917c9f9f2286bd0eae7c590636bcadbe579e0347bfdcbbb38"},"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":"D32","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"235e10cebe9bf64ad19f669a405cfffcf6448fc980aba85b2a305dfafcae7d05"}},{"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":"47a73013ae3cf47ddd81abe1927b6a1c3165cd312ec578bcc806b0b64ac4add4"},"taxa":[{"id":"CICD-SEC-5","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":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060set_realtime_priority\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 generated scaffolding that was never completed. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/rt/macos.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"60945ad688e9508f456276720b89df7cc6def0d7494f8cb6d988d3a506065d67"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060lock_memory\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 generated scaffolding that was never completed. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/rt/macos.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0251919feaf435d76012a0a6b6acba1823af822917553e9f700cf01b742e1bd"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060warn_abandoned_claim\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d999fd0234196c7b5687419c6990482a8abc4aa1b7703853617c4a65ff6084fe"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060decrement_to_floor\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba6c4ee84570749a05f95ca20e7d4281844fedd30456a744fd3db57b5614787"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060mark_thread_live\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/header.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a91a361322215809e09f50968580beb4374a518683de485c10f3e0a01d546ef"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060try_init_log_bridge\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/core/log_bridge.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbce248e9bd7496982e3b1fbcd5707c68505c45eb56b777420bc4e9e5fd08041"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_blackbox_hook\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/blackbox.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20c4793d442c86f467832b3f62afc1ce5d4ebbef3a106da9919a30c2e07f722"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060impl TelemetryManager\u0060 has 6 unfinished methods out of 8 \u2014 a scaffolded type that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a05d03d9f39100dd6b6ed17e21b802837fcc1f34ca253491c5c2ec58bd4ae4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_scheduler_name\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb2dd737ff33ad3cc7f543ac590a94e8847346a387844007a4ce1dc7f571b1d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060counter\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34c61f975da2e1c20a3f9768388aacadd3aec4134dfbae5ec11de74e411693c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060gauge\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4495de3028e37bd3431886615575127a0899fc1819e2ca4836472ac3b9388b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060counter_with_labels\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9104bf52bda914d5ca04ffbf1d779044b0456175f66b8b52785d62b113527a68"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060gauge_with_labels\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"03da09672aac44bde3c12b31b988a0e0ea78b01f584dce7a58f9cc504b6b5fe6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060export\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"077ee838ba77c10fd565ba69d1bb4fe5774bfca4b50e83231d21339df022781a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"852ea686b3d222b6f13082d8e33c4d26546f93c52c046b0a662cd60e2a63269e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_prestamped\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"619e3034eaaa17684b926485a127fd937d0b336db3b547ec91b99aa2c8aa1cb5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060load\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcca8af065dd98ff1bb266c3233030f8a413c92ef524af98798110a94f205af"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_blackbox_hook\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b8fd9d8e6e07b5366d609c81729db6af0ffcb279f24cecf938d7d3f6c2841a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060record_external_event\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e846d88cd406469b6c2fc501fccb4ef9aefd3f4b70d9fdf4321e7976b6b672"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_network_auto_wire\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"360c76a4ff90f8048e7c9527374da990b1846c4fd6247c4ff5ade63b1d93c360"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060pointcloud_destroy\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_cpp/src/pool_ffi.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43724fd6d13644a022313d60fe03577f575b0e74189d9ee9190cbfa14643043"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060remove_generated_build_configs\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd779e0924712c6d5b1cdfff81843086dfe292cca5faa1936540bc1647a02445"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060error\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cli_output.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cc6b1756caf3ffe818775e975f62ccf0ddda1507229052172ac6244d2613e4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060warn\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cli_output.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f111896bcf37143543a18b71569c879015654f1056effabe5460f27a38f632f5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060suggest_install\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deps.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"938a3a007d74a5f7fe2d5ec1b12ac6bf98df37fd96e31f8a3c266f9b58ce78f9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060write_head\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_html.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f506013bca9099e56f2d894b7a07e2340a2fe18560819300dcfad425328534ed"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060wait_for_oauth_callback\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1a1749d1dc3c0fcd440f92819c5d0fc9013a69cbb7af8661e8a1272ed050a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060nodes_to_features\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/node_detector.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e71ad862711f4bedc2bd6b9c314360ff157115423b88502214388ccca0079c6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060register_custom_messages\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/custom_messages/mod.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc516da4c159a9d62c5e169e9baa4cc351706f90c2f6805434600ba42937fb81"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060set_realtime_priority\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 a not-implemented stub in ordinary clothes. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/rt/macos.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4db669fb70d1fcd7247354e4ec46bb73147a85057596524a0f71bc349eef44b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060lock_memory\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 a not-implemented stub in ordinary clothes. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/rt/macos.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"429503ad9d94420845e9685c2f6e734f71cfdea4454f1a95ae72bcaedc0564e4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060set_best_effort_class\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/rt/macos.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0d6276be8d18c143e13b7256edd68d3bf3953696a13ae98517e7b8d5735e5f"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"warning","message":{"text":"CI formatting step cannot fail: \u0060for tool in cargo python3 cmake g\u002B\u002B clang-format clang-tidy; do\u0060 invokes clang-format in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner\u0027s throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one \u2014 it enforces nothing, and no other step in this file reads the result. \u0060--dry-run --Werror\u0060 is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/container-images.yml"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1025fc6892678a6b728d1686efb5413683a412300d6a7dbfc007c5dac611038d"}},{"ruleId":"P1","level":"warning","message":{"text":"CI formatting step cannot fail: \u0060for tool in cargo rustfmt cargo-clippy python3 cmake g\u002B\u002B clang-format; do\u0060 invokes clang-format in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner\u0027s throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one \u2014 it enforces nothing, and no other step in this file reads the result. \u0060--dry-run --Werror\u0060 is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/container-images.yml"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dabea3eb5f700f08d9e0d9f4cbfd4834ee4c0f6199fcaca584f83e17501001"}},{"ruleId":"P12","level":"warning","message":{"text":"Test failure does not fail the CI gate: \u0060continue-on-error: true\u0060 lets the step or job that runs \u0060cargo test -p horus_manager --lib source_resolver -- --ignored\u0060 fail without failing the pipeline \u2014 the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0a0330f5c496e9759c1d4eaa52ab1810fcdceb83de53f0d8fb36304ec33ab7"}},{"ruleId":"P12","level":"warning","message":{"text":"Test failure does not fail the CI gate: \u0060continue-on-error: true\u0060 lets the step or job that runs \u0060cargo llvm-cov --workspace    --exclude horus_benchmarks    --exclude horus    --exclude horus_library    --exclude horus_py    --lcov --\u2026\u0060 fail without failing the pipeline \u2014 the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/coverage.yml"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9325f629ccb74c328597e1afbc85dc2b1a2c76ffdcb03a4e6ce9c168db3681f"}},{"ruleId":"P12","level":"warning","message":{"text":"Test failure does not fail the CI gate: \u0060continue-on-error: true\u0060 lets the step or job that runs \u0060cargo test -p horus_core --release --test \u0022$suite\u0022 --      --ignored --test-threads=1 --nocapture || {\u0060 fail without failing the pipeline \u2014 the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/integration-tests.yml"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5385d52e39bbeb658307ffefd2b58d4e10ffcfd800da9d741c2179160218daf4"}},{"ruleId":"P12","level":"warning","message":{"text":"Test failure does not fail the CI gate: \u0060cargo test -p horus_core --release --test \u0022$suite\u0022 --      --ignored --test-threads=1 --nocapture || {\u0060 runs the tests, and \u0060|| {\u0060 discards their exit status \u2014 a failing suite leaves the check green. Let the test command\u0027s failure fail the step (re-raise it after logging)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/integration-tests.yml"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"24df3261b13e79611582dc139c9b37cb0c254fb36a02cb0e9c6643151cc23fb5"}},{"ruleId":"P12","level":"warning","message":{"text":"Test failure does not fail the CI gate: \u0060continue-on-error: true\u0060 lets the step or job that runs \u0060cargo test -p horus_core --release --test multi_scheduler_matrix --    --ignored --test-threads=1 --nocapture\u0060 fail without failing the pipeline \u2014 the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/integration-tests.yml"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86d8b2e75af078b4930d9116cab614dbd3d062df4a81e1d85f07333bf41d0f5"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 5/6 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!capacity.is_power_of_two() || cap_mask != capacity - 1\u0060 appears character-identically in 2 files \u2014 horus_core/src/communication/mod.rs, horus_net/src/shm_writer.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":"horus_core/src/communication/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd542ce5829da4555aab1f99272e0cba6ac35648ae50e07590de33eed140138"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!name.starts_with(\u0027.\u0027) \u0026\u0026 name != \u0022target\u0022 \u0026\u0026 name != \u0022node_modules\u0022\u0060 appears character-identically in 2 files \u2014 horus_manager/src/commands/check.rs, horus_manager/src/commands/test.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":"horus_manager/src/commands/check.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5733b677cca36cf9268f8808d378ff56cec20961f9a6e2a01b139b4e03091a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!node.initialized || node.is_stopped || node.is_paused || monitors.node_controls.is_paused(node.name.as_ref()) || !node.failure_policy_allow\u2026\u0060 appears character-identically in 3 files \u2014 horus_core/src/scheduling/async_executor.rs, horus_core/src/scheduling/compute_executor.rs, horus_core/src/scheduling/event_executor.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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7d118ddeda129bff95968fcdcddd150127a8cb07b50a5338d592433e18e7cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.resolution.is_finite() || self.resolution \u003C= 0.0\u0060 appears character-identically in 2 files \u2014 horus_core/src/types/costmap_descriptor.rs, horus_core/src/types/occupancy_grid_descriptor.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":"horus_core/src/types/costmap_descriptor.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2ad8be099a02fd568a8a6c95041b847037ee91cc0c556983f50b2fc40c72df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(wx - ex).abs() \u003C 1e-6 \u0026\u0026 (wy - ey).abs() \u003C 1e-6\u0060 appears character-identically in 2 files \u2014 horus_core/src/memory/costmap.rs, horus_core/src/memory/occupancy_grid.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":"horus_core/src/memory/costmap.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d35102583ff343a9918704bd9d888009092c13e7c1a52b762cadca4ce89afb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.is_file() || candidate.with_extension(\u0022exe\u0022).is_file()\u0060 appears character-identically in 2 files \u2014 horus_manager/src/commands/fmt.rs, horus_manager/src/commands/run/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/fmt.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fbb452501611f66f7360fcc7a6ffcc3df6dc12c784367c62613baeb1b3c8c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060capacity == 0 || !capacity.is_power_of_two()\u0060 appears character-identically in 2 files \u2014 horus_core/src/communication/topic/mod.rs, horus_core/src/communication/topic/shm_fanout.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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c009928e426ab9bab8a57caaad186894184d4395c56d5c10a01fc006cfb07fb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.has_horus_toml \u0026\u0026 !ctx.root.join(\u0022Cargo.toml\u0022).exists() \u0026\u0026 horus_manifest.exists()\u0060 appears character-identically in 4 files \u2014 horus_manager/src/commands/bench.rs, horus_manager/src/commands/doc.rs, horus_manager/src/commands/fmt.rs, horus_manager/src/commands/lint.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":"horus_manager/src/commands/bench.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc80cbedf77c3b6ceb7ddc655b63c348521fd3b06f1091f560948ba5a6f9aa8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grid_x \u003C self.width() \u0026\u0026 grid_y \u003C self.height()\u0060 appears character-identically in 2 files \u2014 horus_core/src/memory/costmap.rs, horus_core/src/memory/occupancy_grid.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":"horus_core/src/memory/costmap.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcfa62534ce59a23d55979272518a145e06c360cb3b8bc62b4d1963b9459296"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grid_x \u003E= 0 \u0026\u0026 grid_x \u003C self.width() as i32 \u0026\u0026 grid_y \u003E= 0 \u0026\u0026 grid_y \u003C self.height() as i32\u0060 appears character-identically in 2 files \u2014 horus_core/src/memory/costmap.rs, horus_core/src/memory/occupancy_grid.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":"horus_core/src/memory/costmap.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cff18aaf25d9c4c81e7107486d799209bb1ee0607410d1ed6e3832d9e22aca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060horus_dir.exists() \u0026\u0026 horus_dir.is_dir()\u0060 appears character-identically in 2 files \u2014 horus_manager/src/commands/check.rs, horus_manager/src/workspace.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":"horus_manager/src/commands/check.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c41155ba5d540af0c096ce038fd5b460554286c5bcaeb9c660efb3581e53eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.is_empty() || input == \u0022y\u0022 || input == \u0022yes\u0022\u0060 appears character-identically in 2 files \u2014 horus_manager/src/commands/run/install.rs, horus_manager/src/registry/helpers.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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f5769714d8d324ea6cc4484e7b04ed30103541298dfbe637554b621641b6bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.is_empty() || name.contains([\u0027/\u0027, \u0027\\\\\u0027]) || name.contains(\u0022..\u0022)\u0060 appears character-identically in 2 files \u2014 horus_manager/src/paths.rs, horus_manager/src/registry/helpers.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":"horus_manager/src/paths.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d331a172bb7a3909904dacec461e34e7ac1c970f3ff88d51f71eca410436424"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060new_rate_hz \u003E 0.0 \u0026\u0026 old_rate \u003E new_rate_hz\u0060 appears character-identically in 2 files \u2014 horus_core/src/scheduling/primitives.rs, horus_core/src/scheduling/scheduler/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/primitives.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d216b7c28bdc8a926806491c512b167f4827ea7406e2be04822d06e75adef9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.is_rt_node || node.node_watchdog.is_some()\u0060 appears character-identically in 4 files \u2014 horus_core/src/scheduling/async_executor.rs, horus_core/src/scheduling/compute_executor.rs, horus_core/src/scheduling/event_executor.rs, horus_core/src/scheduling/rt_executor.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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4259aa531bd5487a5b87e7a4645e804dd34a19e47a3703247914d3d03c6b450"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rate_hz \u003E 0.0 \u0026\u0026 elapsed \u003C 1.0 / rate_hz\u0060 appears character-identically in 2 files \u2014 horus_core/src/scheduling/async_executor.rs, horus_core/src/scheduling/compute_executor.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":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1152aef92b911122d8dd58849549662d15a7006b34d9f9d776705da02c22ba1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060std::env::var(\u0022CI\u0022).is_ok() || std::env::var(\u0022USER\u0022).as_deref() == Ok(\u0022root\u0022)\u0060 appears character-identically in 2 files \u2014 horus_manager/src/cmake_gen.rs, horus_manager/src/commands/doc_extract.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":"horus_manager/src/cmake_gen.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"146f788a15578191f7f7c830dd976e744cd232e272ee257047caf97574decf24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool.bin == \u0022cargo\u0022 \u0026\u0026 use_horus_manifest\u0060 appears character-identically in 4 files \u2014 horus_manager/src/commands/bench.rs, horus_manager/src/commands/doc.rs, horus_manager/src/commands/fmt.rs, horus_manager/src/commands/lint.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":"horus_manager/src/commands/bench.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd76bc4c7e9068b23bcc3c5c667d2385b3790a4fa468b153f1ed4a927761762"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003E= self.inner.width() || y \u003E= self.inner.height()\u0060 appears character-identically in 2 files \u2014 horus_py/src/depth_image.rs, horus_py/src/image.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":"horus_py/src/depth_image.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdd79636871d06df892b7844574cefb3aba34da2717dfcc67546fe410dff406"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060render_rust\u0060 is public and takes \u0060t: \u0026Type\u0060 from its caller, and it calls itself at line 23 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060render_rust\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/msgspec/canonical.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d611234d468aecd2298c4825bdc6beb5a0bc849b2a457665eb5558a63c0e3dad"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060render_cpp\u0060 is public and takes \u0060t: \u0026Type\u0060 from its caller, and it calls itself at line 35 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060render_cpp\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/msgspec/canonical.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16b067d68a88a7dfc51540de1041e3142d7720fa58ce7a65033b44b0c9d24db"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060size_align\u0060 is public and takes \u0060t: \u0026Type\u0060 from its caller, and it calls itself at line 43 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060size_align\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/msgspec/layout.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d66c312e157f824be3ea4affc866c4ec84cda54c626e6d64b7fbd3fb511d98"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_slice_mut\u0060 is public and takes a \u0060ShmRegion\u0060 as its receiver from its caller, and it calls itself at line 113 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060as_slice_mut\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/shm_region.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"08580aea5b41afffa870fd739629c1b075ad51f9111b80d96f27efe6fdb21139"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060mem::forget(msg)\u0060 (line 687) takes \u0060msg\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"942dabdd0d228f83c89004345575cce2c4b9eda070ebf965ada260c97ae71638"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ActionServerConfig.result_history_size\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/types.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6152fdcfb3eeabf0a48fde55a0b24db937b20b29a4efb16aa7cd9de39d0f38"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060NodeTickSnapshot.duration_ns\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/record_replay.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceb111cab7aef265c40b87935882f3c2b838f2439b6b44f6d5cf6d31981b1a1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RuntimeCapabilities.is_linux\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"820f6e6b1e8fa57e92de38ded8f2ad10df3646853e28b17e5564101ea7da90dc"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PointCloudDescriptor.field_count\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/types/pointcloud_descriptor.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c4a6a553272f362f0f7890e1e009052d4d752ccca07092af006409987b2e51"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PointCloudDescriptor.is_dense\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/types/pointcloud_descriptor.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b393b79c2de991bac6ee6edcf7c15e01834d09fdb008ccbcbb4be277170125e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ToolchainPins.cmake\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/lockfile.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3178f5d0df293f79ec8b227bdce7f00f43738862dd0c0dfc018ed733b741373"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DriverTableConfig.topic_state\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/manifest.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd34f01255f940e860880da78622e8804903c8e9356bb2005e6eacca80131f5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DriverTableConfig.topic_command\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/manifest.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5022ff575c71748c53558822f5e9d51e65edec42bd2db16300b2fe6fd8563d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DriverTableConfig.simulated\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/manifest.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdf5da3723cf9fb3a7122c66538319f20f0a898338d18ef7c88337932fa4274"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PluginRegistry.schema_version\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/registry.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86d0199140733684d052b13289ef1a2f28d2ae5aded10ebafa8c1f74a81d53b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PluginRegistry.project_name\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/registry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6eae131393985f1fa497e6a6f57eeceb52b2839fe88c6a05d28ba4318a0767"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PluginRegistry.horus_version\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/registry.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd3518e35754aedbfa164e15ffd2b872a6d31fd5e4e9be5f196a92eac5c2b66"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060InstallManifest.installed_at\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/version.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e55334916e58f56fbd0b4d6857e72619dca87778c0f2db7acc86d77937ea0f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Clock._pad\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/time.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb354db15592e44624b289f16b53313d2bc5363dc5b4dffa195a59e6821c235"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SimSync.sim_time_ns\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/time.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fda6247526ef20dd7c775707a7ba2b74d242f51f8cd2ed41a870c739bfff49e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SimSync._pad\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/time.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e5b5e64ae75c689371809fcd34610bb8b822d5597f0645345d2c08aefadaf1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RateRequest.desired_hz\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/time.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba541afec4b7db3c8460407a0411f624385a44948f48198488d49c9baf3d17e7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RateRequest.min_hz\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/time.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"feee2543d94210fefcaf7e62e838bf7f07d15f8c89b3f94e7e73d46054533b41"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RateRequest.max_hz\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/time.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fe7d12e9b352e08eafba0eb1f2920909526363bd6e0f783e84a68063ef4444"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RateRequest.requester_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/time.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"822c04893a2e8d51f93326ca11d419e137e5147f06050212c5e347c4aaa44c7d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 185 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/drivers/exec_driver.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0892ef19d575ac136248ae7cd664bf357ae4b66e0deb38fced8506ce2af13b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 199 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":"horus_core/src/drivers/exec_driver.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb1c864cf3eb0042c61b0941ae0281216e79c1f0e2529e179cdde3953e1b26c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 205 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \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":"horus_core/src/drivers/exec_driver.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8848b86dd3d9bfa0d1c71468c4ef2b54988a5fffe5f111a21543316445d30cde"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 247 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":"horus_core/src/drivers/exec_driver.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"4849dbd4bd40558874650c6666de16e8239582001791357bfe8cd07038e84b5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 267 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":"horus_core/src/drivers/exec_driver.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3b44a65e7d5d4b7291035eb47823b43a8796cbfad14620661bc9abb73b0d7f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 282 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":"horus_core/src/drivers/exec_driver.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d00ea73ccdb62187fca7350f71d894f6f90c23457ac5df8bb48ea0462211f02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 307 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":"horus_core/src/drivers/exec_driver.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6339ee2def23efe083978d366a643ebf652ffbdabebf39006685ae514567815"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1203 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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"008a83b3f61975e069bd5f00a01eb1d2b4b6a49e756c7ec4322a6f920c77ebe2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1325 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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56df8fb6824f781684ef1ac7db575b08c8e4af98bce606bb0bf52fde15f5497"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1894 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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a39a61853e828ed0bfbcd2421d923e1750323e38af99443b2d6d615a5e9bcc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2636 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":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":2636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f8ef3d67d0ef899ac4e98e4e356fb3e7c59cb039d3588ce097e62ff3e74c85"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2204 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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec043d7868c50aab0a9352ea0a81aafb5a323547503415f87cdf666941cc5516"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3639 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":"horus_core/src/communication/topic/mod.rs"},"region":{"startLine":3639}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb257f0d47f66dce335abcb669eb3147ca04f0d1eb81a4fd1416ab7ff4eb2ad9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060timestamp_now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_types/src/diagnostics.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceb5a8a4f5aa1fb47f8a76b128aaa17f6179fffbc7d30e286cb89d1ee64eb61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060src.find(\u0022\\nclass Node:\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060node_class_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/python_api_docs.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b12d908b1c22343dd4495e45ba29b2cbfced7aa2ba15a66c8206ff56d0b4f8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060class_body.find(\u0022\\n    def __init__(\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060init_annotation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/python_api_docs.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b5d4d0dbeae5580f4f9650fccbe477167e6db8480623b943d467fc266dcab3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060class_body[at..].find(\u0022\\\u0022\\\u0022\\\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060init_annotation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/python_api_docs.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f44577f299515c7ae572487c0ee4daf6f910ead334b029b7588a932c5f129c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ffi::CString::new(\u0022topic endpoint host ignored\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/topic.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a45ac4bd9fd8d03439aa8d9568bccc8bd37bbad7b6914c8c4c2cf37771ed1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending.remove(\u0026key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060feed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/fragment.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55ad03c300273eb1e8e8e47da5d1c0ba344142b706865bc84502c5d3e445c03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022# Generated by horus from horus.toml \u2014 do not edit manually.\\n\\\n         # Edits are lost on the next build; add a [rust] section to horus.toml instead.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ff512eaff10b34a025de0b70e8282b5e143255d15c5284c881d537a3590eee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[package]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd87a39d948585bc1934363625d08db8ba46b4f7341d92b5a7a104d3347cd9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022name = \\\u0022{}\\\u0022\u0022,sanitize_cargo_name(project_name))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"173190b1a0f89deade16153b33e25b010973954f6b15a935405b9fd9f8e26dcc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022version = \\\u0022{}\\\u0022\u0022,version)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6a2fbade18156ed3a85db476bbb0454d0b1eb96584a1eaaf703199ab1f50de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022edition = \\\u0022{}\\\u0022\u0022,rust_edition(manifest))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dfc54c58328f67974d59430b0e9155606b183a409f8b3b4d5c44fcd21e5ecd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ea5714bc58001e9ce915608d4db9b42db670d64298a98f2b5e6c00d97e1162"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[workspace]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7d46fd4b16f3e2f4b51550503bb44c5027ff27d972f353cdce96f7617c4e8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d101d9dfd77279e6067b05bb3c3dab13117a3c037ec6d3a91d09307765bfd623"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[dependencies]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d720dc449340078e7564ff51339e271b6f8a431f664f3ded7671c083da9d9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c9e47c66c1720b09e8400e5c46368daf980cb4edb05855094df41eed8fabdd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[dev-dependencies]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a35e30ad48c403d8fbc95052ae04fffa5f463983d13b77b85228ec2121b2a8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(wanted,\u0022!{name}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060ignore_generated_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17a450b7547690530b926d29916a313321ef2ef521294d74061e07a5bbf6fcd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(text,\u0022{GENERATED_CARGO_CONFIG_HEADER}\\n\\\n         # Edits are lost on the next build; change [rust].rustflags instead.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_generated_cargo_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"651f72e55b9e64048178161619e90a06a3c8d68b8697d0e328e53ef2db6cae3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(text,\u0022[build]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_generated_cargo_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a19e6f9a2f2be8d0e6667d5f07874a67e6fb1b04d154b1d9064acc0c73d131"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(text,\u0022rustflags = {}\u0022,toml::Value::from(flags.to_vec()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_generated_cargo_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6f1f121dbcc914eea3ba17c6579ee6f7ec2772777ca23a236cdb728b8e2252"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022\\n# Driver dependencies (from [hardware], or legacy [drivers])\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_driver_deps\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"1905f1180c172799e2f5efd270c6aab9a840625b441fc87f5d155fb4714393af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = \\\u0022{}\\\u0022\u0022,crate_name,ver)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_driver_deps\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb5d81e04a96e157f0412ebe9956f35eb518ba267978a7d36c82f3de6de02d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ version = \\\u0022{}\\\u0022, features = [{}] }}\u0022,crate_name,ver,features_str)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_driver_deps\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58759a81906b65b11a3166f593bcfaa0e996d869b2c716b89c51645a8fb95e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[[{kind}]]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_target_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"3979e0d632237b8c4f7e5b5b2807ae1973e2f9a482a79c45131bb0af3a71722c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022name = \\\u0022{}\\\u0022\u0022,sanitize_cargo_name(name))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_target_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"2620ed7cc4d2253b33f87d9322ad0189fdf6095745c7f8dd06162996ef0a4b36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022path = \\\u0022{}\\\u0022\u0022,toml_path(path))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_target_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"5650b0bdfcaae3fbc45fe58e5d4c1124b29de8b48715da69abbc07bcd3afdc8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_target_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f5e43c1ab81a3df2f14d2eebe3ea1d45951486e947f90aa71ead772629c569"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[lib]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_layout_targets\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef83ad50d39d19b04c1267a48bcd5f62550fd2506b39b10a161b442e2ebce74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022path = \\\u0022{}\\\u0022\u0022,toml_path(relative_to_horus(\u0026lib,horus_dir)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_layout_targets\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"143936c916be45a7e04e3af94ecd86849c544ed2c27af17f0297aef782bf229e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_layout_targets\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5eaa948d6370c882ee0132eb373271203257d6f0c4535ca403a00b86073430"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022serde = {{ version = \\\u00221\\\u0022, features = [\\\u0022derive\\\u0022] }}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_implicit_deps\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee660d5b457c7931990238f2bb2ef7ce61656253e36632332dfec4b0067cabcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{}_msgs = {{ path = \\\u0022{}\\\u0022 }}\u0022,sanitize_cargo_name(\u0026manifest.package.name),toml_path(generated.display()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_generated_msgs_dep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b44b49729b2ec8c8fae96a94c2168f50351c3ee77361670b2dcac984275201a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ path = \\\u0022{}\\\u0022, features = [{}] }}\u0022,dep_name,toml_path(dep_path.display()),hw_features.iter().map(|f|format!(\u0022\\\u0022{}\\\u0022\u0022,f)).collect::\u003CVec\u003C_\u003E\u003E().join(\u0022, \u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_horus_path_deps\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"742cd33a2b070bdad25c01b5b7d72c8b2bf8293273dcece1340544690778e6c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ path = \\\u0022{}\\\u0022 }}\u0022,dep_name,toml_path(dep_path.display()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_horus_path_deps\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a5e58576289ad0fa0b0f2ccbb9505db7f96bdeead554bc2b104799c3975cd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_rust_passthrough\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b750b29ccd69296eaae7788ee7bf0d38457ad0348cd78d5fb897a17de7ec04c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_patch_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a9f8340246872c4551559854947ae5f90ca9ae3f077a7844d5e02bd776069a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[patch.\\\u0022{}\\\u0022]\u0022,git_url)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_patch_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"967b9f4dfc1be78bb19841e8fd0d151c9d882292d22a0e96603fc35c9783857e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ path = \\\u0022{}\\\u0022 }}\u0022,name,toml_path(horus_source.join(name).display()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_patch_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ceeb97c33c33799f2e3caf132264f3d8f8599966c94ec2d4d01f56fa72e94c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{key} = {value}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_patch_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"073b08caf1ba6e8eeb774204ea027ff95fe3f8c3bc842a74fe1fff151ee139a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_patch_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b972795aa9c6809743cf741e1c8286c6d6f732b4bd02e4c0c0f7cd58c100d70"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[patch.\\\u0022{source}\\\u0022]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_patch_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbd4cbe339017d7d99a508a10f56b93af57270af57a1046c54d17441736aa67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{key} = {value}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_patch_sections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9628093c290c079596b44b80a0b6841b765c323ae3b3e2c284f74c1973f73bf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ path = \\\u0022{}\\\u0022 }}\u0022,name,toml_path(\u0026rel))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_deps_section\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"53985acde4af0329d5558e02241db7fda5f087d8b89b534a30cccef08e63312c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ path = \\\u0022packages/{}\\\u0022 }}\u0022,name,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_deps_section\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b74e830ac732f7d034b67e4fb02ca8f52c02b45480ba47c220920519c71ab25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022# {} = \\\u0022{}\\\u0022 (registry, not yet installed)\u0022,name,dep.version().unwrap_or(\u0022*\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_deps_section\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b851aa8bd3999414344dfb622eeace5b59451a7cd62b3f2c0524035499715c70"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = \\\u0022{}\\\u0022\u0022,name,v)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_crates_io_dep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd882b4a1239aafdaca60dcfd8fb1f2a7d12b821589e7da57b728782e29254dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = \\\u0022{}\\\u0022\u0022,name,version)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_crates_io_dep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6df9649e90ac3d1ac2b4ba07e67078e73851a36246b796b4519b25c3764272"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ {} }}\u0022,name,parts.join(\u0022, \u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_crates_io_dep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db35cf8fe64962717e2c12e0bb1ced9ed895afce8e84c1adb42671201e09bfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ {} }}\u0022,name,parts.join(\u0022, \u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_git_dep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eda22942e12ddb17867542be3e30c3e22b950a1df02cd4c5b779b467a0f2f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(root_cargo,\u0022# Generated by horus from horus.toml \u2014 do not edit manually.\\n\\\n         # Edits are lost on the next build.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"277ad491568a2b7e1f0e0fba16dd400a4f3626b907815a5b1cbbe4d45b8bfc8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(root_cargo,\u0022[workspace]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7c3739caeea2f62be442ad3a65c0c86ec7b6a7c09d443bffbc283cbf7362da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(root_cargo,\u0022resolver = \\\u00222\\\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"4352ff51ccc4d6fd5ff29213bc2d8d2060cbea44ae0695beaaba1561c9d2e986"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(root_cargo,\u0022members = [\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b65fada19b4dcfdedf1a9c10296dc81e6a531041658822604ac03dfdba4cca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(root_cargo,\u0022, \u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c31c3c26c3ba269b529819be82449fdee78b251b85135c7336ae9133b96b77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(root_cargo,\u0022\\\u0022{}\\\u0022\u0022,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6845c27dbf30bdcfef225492d2747199c46d525bb98ed0594121bec4d68770"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(root_cargo,\u0022]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"16410848da8c22fdaa555bc3155a1ddff4e866fcfe2f7f748ff869644b2940a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(root_cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"4422e69edf738d4d4451f97909a8a03a035e7e4aa5c573f1ea7961dbd426f9c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(root_cargo,\u0022[workspace.dependencies]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcfc1d1ce3ae2f94361d89d81162b82f54e9e6eb53ab1f73817d4aa2228a20a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(root_cargo,\u0022serde = {{ version = \\\u00221\\\u0022, features = [\\\u0022derive\\\u0022] }}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a638e213f16e22afbdd7b5cbe2dfc7e40dcfac71fa93f7c53b96258b14fcdf6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(root_cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6094c7881852f412ccef7e5f2857178b287f770bdca1fed42bb990296947c28"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022# Generated by horus from horus.toml \u2014 do not edit manually.\\n\\\n         # Edits are lost on the next build; add a [rust] section to horus.toml instead.\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9384aca8f8272e1a9e81dc3a88d565cce03f2077b9dd099d80589af0ddb4e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[package]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db6f98406b3a7070b4f8ca2332a2f970d937cf83b5ffd71d14c0f37b5f4b724"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022name = \\\u0022{}\\\u0022\u0022,member_name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"992d2bfa70e003e8ccf09d56b1ab5e3933e476923d85ad2ed82d16419215ac75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022version = \\\u0022{}\\\u0022\u0022,member_manifest.package.version)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3729cfb3da4e8ceae98d70236bca9b4c55ed11f228a4045a33322439bf32e94c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022edition = \\\u0022{}\\\u0022\u0022,member_edition(member_manifest,root_manifest))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea795649b85128edbc0ebb18c2ebc7315977bbaadcadfecf83efd53367afa8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5c06603e4ba9d5560390c3518039309cf56e33dc75483253ce8d0d6168f40f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022[dependencies]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3675ddd8f59d7a2e23fb3fab745e109603ee82bc4a68737bf10924c066e16772"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{}.workspace = true\u0022,dep_name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01f0368ed104f97c7ae052275995fb84a8da941996edcfdef77fe596b695812"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022serde = {{ workspace = true }}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f72f26ab5bcca81c8649be062a8ce8099e02ecce69278d0eec3811f2d9be73e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{}.workspace = true\u0022,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a0a6d7281ea755e076f9206a482d036ac949f6a352482407bedaf75c322d6c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ workspace = true, features = [{}] }}\u0022,name,d.features.iter().map(|f|format!(\u0022\\\u0022{}\\\u0022\u0022,f)).collect::\u003CVec\u003C_\u003E\u003E().join(\u0022, \u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8ba0c97e1224f32d14c97fbe04ba01cfc27a9202cdef5184cf945b1b801643"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ path = \\\u0022{}\\\u0022 }}\u0022,name,rewritten)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2d5dffba77f6608b87fa436daaeb806a4c88afb69c91996d2bb581e93d5ce5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ path = \\\u0022{}\\\u0022 }}\u0022,name,toml_path(\u0026rel))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2210bf8ab2dc058822c7fe069a06ffa74839d0612adc9f20428d1988a760ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_member_cargo\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84a02396c6d9a5e4c4bb80b86f457b00af3349455c1e3053cc85061b44e2df1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = \\\u0022{}\\\u0022\u0022,name,v)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_single_dep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfed537f75ca880b6f03ca5a4ea0a9ca8f8fe723538d06be82c6c9ef0697bf60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = \\\u0022{}\\\u0022\u0022,name,version)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_single_dep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a99f1734c57ef93db491a03bdf08c34207ed15996f4e570bdaf0df1ffcaaccf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(cargo,\u0022{} = {{ {} }}\u0022,name,parts.join(\u0022, \u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_single_dep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfa8c1ccc693a2a085bd63d4cf27aefc7d227672d863032d5e4fe540c7b6ae4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DEPRECATED_NEW_SHORT_FLAGS.iter().find(|(c,_,_)|*c==short)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060warn_about_deprecated_new_short_flags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/main.rs"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d7a1ad7304704e35d00ae9be8a19685a6469917cbc2757ea9c3eadc9b13ac9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022horus-cli\u0022.to_string()).stack_size(CLI_STACK_SIZE).spawn(cli_main)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/main.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"934722bfd06f2883fd574916b10bdbc80e89d0d89ef96ad06176d89e308f0d75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.workspace.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060validate_issues\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/manifest.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efe68de5ad3ba3703cbc7f1ef5b4c8aee557e4c787a5ea3cbb314c83a77fc6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_manifest_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/manifest.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"98da9d5d9733ddc152eb98fcdea08a7717b3366c0d7e1121dd76918d9072771d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ProgressStyle::default_spinner().tick_strings(BRAILLE_SPINNER).template(\u0022{spinner} {msg}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spinner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/progress.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f5f1b33c089143e837776647377d8570a3a8d6d35aeb5bf8cebc18f1c43952"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ProgressStyle::default_spinner().template(\u0022{msg}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_success\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/progress.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ec2719734520d1d861dd430c4c9bf677019125561eb0d34ee60076173aa469"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ProgressStyle::default_spinner().template(\u0022{msg}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_error\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/progress.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6347761a8989009141daf8b17aad5067489e32272489324e551bd17a863347"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022# Generated by horus from horus.toml \u2014 do not edit manually\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"027e237152c400bd93e567ed122e102edd747053bcc80b6ea369eb4a66940b6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022[build-system]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"369363cc0af4d006c29006b3cb698f66991731b0e289453026fc75044af33759"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022requires = [\\\u0022setuptools\u003E=68.0\\\u0022]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11edd661d90357e084310bed5dc103c3757151b9316c17df3fb65889a623f58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022build-backend = \\\u0022setuptools.build_meta\\\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7244e1cc68fc9b61b35f28232d271a96729bf64048ced7cd330ffccc8734aec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb93f65f8d3a6d21c77a3b24613197d2e3c639ad72262f732975243edc2c0bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022[project]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8008996d5c762be0436852af50e79c66a14e10ac68d4d3c762f7797a42f20142"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022name = \\\u0022{}\\\u0022\u0022,sanitize_pypi_name(project_name))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd484ecf12dccdee23f7f176b118728757a9fa8aeeacebf65cbb59f58912db2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022version = \\\u0022{}\\\u0022\u0022,version)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8509b9453bf5151a57e614a8638ac84b93bf96c017758982e2aa7b9c2aafe081"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022requires-python = \\\u0022\u003E=3.10\\\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a20fcb81e196244e8d0cc89760e5c1d7d185afe6f4d30306ac70a5a59632b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022description = \\\u0022{}\\\u0022\u0022,desc)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e0357d37924803333bf7b980a053e29c15cabcf59d7280e0521401b76d284b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022authors = [\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b39d4df3b5dc16a51d71e582c056ef26729bf9aea6c4d4e3892baab7b5369a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022  {{ name = \\\u0022{}\\\u0022 }},\u0022,author)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"701f3bf2e2d9d37cd9824520ef531a8e4f1b1d85681d479d57922c28f644539c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d247ed37b76f0b327803ec507638506992e06f80751b505905efff363b33487"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022dependencies = [\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d045b5eb02a0e5169ff65a033579b9ad749756989a8ab758d7338b70874b7f91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022  \\\u0022{}\\\u0022,\u0022,dep_str)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed55e3c9e4fab3538236b7fb905e9844b930ed18bc291e28eaf9859c71dec4d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f984d2ed6c01c5662a5248cf31c0e1abcc072906ce54e46a458d43e7a17ccb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022dependencies = []\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fb79f359d8bba64c30194ed82544c0fc91d3a60ec383d56a61a24354342669"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4fbb6b9ff7b1805091aae9b4035c3bb5bf866ddab256f4ebb4aefac810f80c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022[project.optional-dependencies]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8a0c16ddf0d9d31d2c27757426088c1969d1115eb99737b7783cf34d5bb589"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022dev = [\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fd5f16400f5d3322aa14d74287b840a9e653181eb0ca52595f03ca418a8fd6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022  \\\u0022{}\\\u0022,\u0022,dep_str)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d52b03448003d68f4ff55c0ec77f497af22a2a8daa0cfabbfe49ba0d1a0e02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c2e4175dca3b0d2f257a7f1bc63752eeb1856d687fc564073c265ef797cf2c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8dead4bb950c4fafefcfde67f785716c4bf343fb0406aa87ac3d1cc28bc5d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022[tool.setuptools.packages.find]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7951270b3754ece18969a942d019ada25caf3a208c05ab3ce4f9296bf7ec9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022where = [\\\u0022..\\\u0022]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc8c7a250bd1b247d573b5629f7dc307b1257c8b253b216fed655d6ee003989"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b94751c0a9709f10d3f59b380d91e3aecef3a1e51f3945faec9b1aadbf277"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022[tool.ruff]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c909401c69f1ad271e58fc0b8524a29d31ef1e75daa5f83c0281dee1d10531"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022line-length = 100\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1372f42a0eca7076492c8c269cd15989b872f517fd096db4c71f83764e53aca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(pyproject,\u0022target-version = \\\u0022py310\\\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/pyproject_gen.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0290aca83d37e39ef2339ac213f6904997a4caa5e05dcf04ab8caae218cf9513"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_with_prefix_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/run_with_prefix.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b9a4004aee309636dd33b515324f704528d51cb6a7cd4d26d78d0066452f13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_with_prefix_output\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/run_with_prefix.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2eadd2f65c8133287cc6f7d2492d6e167f98cef638c83819f2e2ca94174ca1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060workspace_cargo_toml.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060install_from_cratesio\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/install.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9723f0fc2efdd58c986352a8489673af16c1312be03fa91fa118bb118b133a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.project_registry.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_or_create_project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/resolver.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e693d88065db421ab8d86b18280055b3c086e2ae661569d55ac6101261bc2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_toml_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/config.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"218736bce1f8eefa9eb4b120acd296c4e79f65e94e9b0e68337b74c5570f3522"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target_names.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_deploy_multi\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f41d21f05eebbf299a53ce7b40355606526b373948ee62e3ca58ff11c55559"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_function_params\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"710d965f6fab2ff9cce957c811cef35a38c799aaa1ed99b84aad5d64e1deb39d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060regex::Regex::new(r\u0022//\\s*(TODO|FIXME|HACK|SAFETY)\\s*[:(]?\\s*(.*)\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scan_cpp_todos\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_cpp.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfa7beb75b2e977baa97e7d40e95edb1b811fa6d6dcdbe816da604d14d00a95"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060regex::Regex::new(r\u0022//\\s*(TODO|FIXME|HACK|SAFETY)\\s*[:(]?\\s*(.*)\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scan_todos\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doc_extract_rust.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fd02bf5a89fd70deb801c2c0bb2e2710d6418b0a20501fc7f2d1341cb2b1c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026entries)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060print_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/doctor.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c095ad9152d4b1022cdca4ad6909cc8f10c20cf116dcc19dfed42fa6fdae8e01"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.workspace.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060eject_workspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/eject.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9775a4fbdeea5def2828b0f87d8cce681bf763268ef91efdc4e6b54e44734ba6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060listener.local_addr()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060login\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/github_auth.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b779e18ab43de3e3f7d1ca40df9961f2484860c161fd75e7c6288353a580a837"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060name.chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060validate_project_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/new.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eed8711e200d3a946b77cbc486274003d67cb44c044fd61a9a102dc60cb694"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060argv.split_first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_privileged\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/setup_rt.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d230c8a674584160deea2d3f3423415895f8007b0f6c2e151c536a6dad218ca1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060find_topic(\u0026topics,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060echo_topic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"731886c399c6fe32b1111780d891aa5536ffd67b4b58f8b79adfe69e94a75b9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rate_samples.front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060topic_hz\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0f9a03733257d2b44614ee4502614266a46d35ecda3c7a86558ed04a8d0a72"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rate_samples.back()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060topic_hz\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/topic.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37c08d978cf93efa3a871f418ed07c84222a36ab731f6692197f677c97cd3a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_glob_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/run/mod.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bde5c2bb525ba3ca050072411493ce6e2ca4cd14fdf6d7fd7be30923c37d4a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::horus::horus_core::communication::Topic::new(#topic_expr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060impl_node_macro\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0385e86ff1d803a9672f1f81093d6343cb0a8ba167945491949560af455f84d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060::horus::horus_core::communication::Topic::new(#topic_expr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060impl_node_macro\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_macros/src/node.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"030cf72dd4d97967e56b7e97bd509a4d1f0ec1261227157e29d525340ca8c56b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060shape.iter().copied().try_fold(1u64,|acc,dim|acc.checked_mul(dim))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/types/tensor.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79f42090bd9908a3f76fe78b8749ca3c3ca90d152397fc2c29350486f6dbf3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060num_elements.checked_mul(dtype.element_size()as u64)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/types/tensor.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75bc372698df843bdb62d305f76cf88a3c9aa559708322308699130b5ed1904"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().stack_size(512*1024).spawn(f)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060test_spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/testing/mod.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dc61c64a1c6e8dbfe82b10df09436414bc1412ef68e3b9e04a4b6116339a68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::scheduling::rt::spawn_best_effort(\u0022horus-async-io\u0022,0,move||{Self::async_thread_main(nodes,running,tick_period,monitors)})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/async_executor.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d53c7e7bd3a12ae68db74c9de7227643f9f60e87f400c6bed720c5916c2470"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::scheduling::rt::spawn_best_effort(\u0022horus-compute\u0022,0,move||{Self::compute_thread_main(nodes,running,tick_period,monitors)})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/compute_executor.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dbd41dc654cf5c969aee43a6eb9ec82e93d34f8187d2e223a612e4de44bcc6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.tick_budget\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rt_thread_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aac990574a6df52e94f2d0f174d045d025d8848a78daf6c79dc444ad47eaa5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.rate_hz\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rt_thread_main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_executor.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa005269a0be85031ddfc40562dc7f30c132b983a8eca91f8f522303d67f2c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.partial_cmp(b)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060measure_jitter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/rt_report.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b820e3de9deaacfd3bca487bafafbe1e0c77e5342df215b8202f95e781400efe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060states.get_mut(node_name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060evaluate_degradation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/safety_monitor.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc8be861079034b07c0c666626531964f563711e22565aa06763bb0704afb32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.dispatch.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute_ready_dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":6465}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c08fb7cf32cb43cd0d3056158afa92bedf3651de45d803f7a585e7dcb2e07e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.dispatch.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute_ready_dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":6494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceecf81074c35231e62de16675a85e352bdb74a8fa4262c686728de6155eb12e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.dispatch.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute_ready_dispatch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/scheduling/scheduler/mod.rs"},"region":{"startLine":6517}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cb14d83afe8b06c6529ce6bd686383f2ecdff149cc66406ef34901c3090929"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pool.data_slice(self.descriptor.grid_tensor())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060grid_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/costmap.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4e9dc9143a78a2b826cdf3268bd90c0001b3b6f06eb02a29df2bf42cf38231"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pool.data_slice_mut(self.descriptor.grid_tensor())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060grid_data_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/costmap.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95503ca27e7c92333fde14902c6d90d665b58ac42b03f43450c18795b40e85e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pool.data_slice(self.descriptor.cost_tensor())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cost_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/costmap.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f30380c3cf70e0bb70e8c8eab6a9b7f93a104c9be8c50bd2ec92ba7025b5579"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pool.data_slice_mut(self.descriptor.cost_tensor())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cost_data_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/costmap.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bfda6252b632602d005a2486954c0870f0cfb07b775e8142c76cffea854fdb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pool.data_slice(self.descriptor.tensor())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"db599d9c2f0301acdcbc2c5fd352bd34665b3668ecf4294a1354cdc04d167f5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pool.data_slice_mut(self.descriptor.tensor())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060data_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18626e29598c8de507da6bb15a311f03d8e3b8cf535a406f23bfd7534d87142"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::from_owned(tensor,pool)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060alloc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/memory/tensor_handle.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fefdc3480bc37ae7d3902ac77da0302df01883f114cab6a351754f628a423d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060recv_fanout_shm\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/dispatch.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffc5878e951905c1a85ba6d1315467c746f95c8a45a9740461ff2faec740e03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060global_pool()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fallback_pool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/pool_registry.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa29a74f89a602c703fe328018b83cc2765832c427d3633d25fe411b0ad743c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060default\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/actions/client.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"475d3d81bcbf104d9d2cce6a3ca41bde9565227bed827c6f716d7f431f720c74"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060failed_runs\u0060 returns \u0060[]\u0060 when \u0060json.JSONDecodeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/autopilot_triage.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4d619cc532b30d2ebbdc5133639427cf21164b4ae1ba20390972aeb2226a10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060main\u0060 turns every \u0060Err\u0060 into \u00605\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":"benchmarks/src/bin/competitor_comparison.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d231444b4f8ffd5422b55ee88be28c889075607fca8ca485bd0b75f39426c23"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060horus_params_get_string\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":"horus_cpp/src/c_api.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b130d9781d04d19948a7c5b3bc1f48d659055101f7ee2c4c919ab529eb65e328"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060discover_registry\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::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":"horus_manager/src/plugins/discovery.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e34050eb9af5fb9165a8a9ff7f493301445b8877b701aaa026ab92bda53d35b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060deploy_python_requirements\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":"horus_manager/src/commands/deploy.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33107d6aaa6516d582f68c6ddae19ee4a8a487d3e3e0359c144aa9665bfc59b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060git_packages_in_lock\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":"horus_manager/src/commands/msg.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e5b00a2a4f109ee16c4b959586ec67ec18735fd6ec15894c4bbbe13ee6b81d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060top_level_modules\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":"horus_manager/src/commands/run/install.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f917fcc73e8973f447b9304c8c4862ebbf5144b61cb25d89f11d9178502f278"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_unknown_keys\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":"horus_manager/src/manifest_lint.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"647b543cac454c38df2c02ec5dcb61e2f7e0a6ba9fef39ffe59dd4e5eede7ff0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_horusignore\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/registry/publish.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e7bc6bb871ecb556cadc2e95a1f6a270a4d83083be62a513c8cc603f7ec34f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060from_env\u0060 turns every \u0060Err\u0060 into \u0060Self::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/src/netfilter.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2da06c794055ad6668f0e36b217d12606869c4d6200b33b1011bb442e77c26a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060__repr__\u0060 turns every \u0060Err\u0060 into \u0060Ok(\u0022NodeInfo(locked)\u0022.to_string())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_py/src/node.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c474a2abfd53f077495c2eb8950fb2aacfcac20a5d623498354ca2636944275"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_nodes\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":"horus_sys/src/discover/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cca0340d26b6d9617000a1fd6a63e6cc38cd72e5629a41dc589a1b45b707801"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pid_start_time_linux\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/process/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c4725eb5b89406907693638bb01aa49038f059a1cbd5e53a6de1ff090b9d4b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060present_cpus\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":"horus_sys/src/rt/linux.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cc69ebd8456636d469d0c3635fc675d922f31929b2c01b838b2c6f27cc4939"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_isolated_cpus\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":"horus_sys/src/rt/linux.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fb6763e61703922e218c8861478196596a362894bc2059bfa349a486370f20"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_nohz_full_cpus\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":"horus_sys/src/rt/linux.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bc5b44b6a7bbf9aaee9dd109d6bfca1d53675397b0ab6fbccece97b3998524"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_windows_version\u0060 turns every \u0060Err\u0060 into \u0060\u0022Windows\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_sys/src/rt/windows.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"737799aa8b40f9f49520b3f3d6611fde105b30d7e904e807d15ff63cbbfaa20e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_topic_metas\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":"horus_sys/src/shm/mod.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7163aef2451558b373fd674161d137e67c78aae1ab596e64d0c1ba88dc215f9e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_all_horus_namespaces\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":"horus_sys/src/shm/mod.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"b496f81a56a5ae1c4a89973e417e650facf15370cddd4b54ff9801cc9191714b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060code.contains(\u0022eprintln!\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060code.contains(\u0022eprintln!\u0022)\u0060 also satisfies \u0060code.contains(\u0022println!\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_net/tests/replicator_output_safety.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a359235b0b2fd960c3a475bb4232ffbc41c0d100011941c2d79ca7c476f50039"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060l.starts_with(\u0022*, \u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060l.starts_with(\u0022*, \u0022)\u0060 also satisfies \u0060l.starts_with(\u0022*,\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/docs_examples_python.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1949154d6e8d332d567596ef24136ddb45330b8e996dcbf9a3923b432e56ab"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060combined.contains(\u0022e2e_camera\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060combined.contains(\u0022e2e_camera\u0022)\u0060 also satisfies \u0060combined.contains(\u0022camera\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/e2e_introspection.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c456cb0b0916fa6da3d0619f668d1040b783f54c5189c99e5854c0e7e70dfe3"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060combined.contains(\u0022e2e_imu_data\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060combined.contains(\u0022e2e_imu_data\u0022)\u0060 also satisfies \u0060combined.contains(\u0022imu\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/e2e_introspection.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9daa6f7730ffb57cf974847dc3fca34fe0cd903ea364af710f4ce40445054905"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060content.contains(\u0022.horus\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060content.contains(\u0022.horus\u0022)\u0060 also satisfies \u0060content.contains(\u0022horus\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/tests/workflow_e2e.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2589506fa2b6e9edbdad9b9d46d05d672fdd679816b38242e90ddbde106b242a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060content.contains(\u0022src/main.rs\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060content.contains(\u0022src/main.rs\u0022)\u0060 also satisfies \u0060content.contains(\u0022main.rs\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/cargo_gen.rs"},"region":{"startLine":3821}}}],"partialFingerprints":{"codehealthFindingId/v1":"7015726631ebbdeed062f2783aca350b0e7b11dd74da78bffe680fde08288458"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060stderr.contains(\u0022ld: cannot find -l\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060stderr.contains(\u0022ld: cannot find -l\u0022)\u0060 also satisfies \u0060stderr.contains(\u0022cannot find -l\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/error_wrapper.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"925167e368ec53c8af6f0e6ea0004015fbde406a1fdcea025f70c37f07ee1d36"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060name_lower.contains(\u0022rplidar\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060name_lower.contains(\u0022rplidar\u0022)\u0060 also satisfies \u0060name_lower.contains(\u0022lidar\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/plugins/discovery.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b1e4f330f373f98da52261df5a547b339a62bda2a88d7f36d1592389227e3c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060age.contains(\u00221h\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060age.contains(\u00221h\u0022)\u0060 also satisfies \u0060age.contains(\u0022h\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/discovery/tests.rs"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54dd390c188e0dfb5f3611e560a7ab95712ac766f37fbfc544ab762b8f77304"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060t.topic_name.contains(\u0022transform_frame\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060t.topic_name.contains(\u0022transform_frame\u0022)\u0060 also satisfies \u0060t.topic_name.contains(\u0022transform\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_manager/src/commands/tf.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"665de8a5a156b11a4fbfeeed2eb53a5a69fc31724464bbca34f3ed6d7e9740f6"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060output.contains(\u0022sensor.cmd_vel\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060output.contains(\u0022sensor.cmd_vel\u0022)\u0060 also satisfies \u0060output.contains(\u0022cmd_vel\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/tests/cli_runtime_integration.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c654c1eaee0a27ccd2dfaa7aa87745c156761e97a32fc89e7b56859c6a4dfe3"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060msg.contains(\u0022File name too long\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060msg.contains(\u0022File name too long\u0022)\u0060 also satisfies \u0060msg.contains(\u0022too long\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"horus_core/src/communication/topic/tests.rs"},"region":{"startLine":8044}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7502fdf41e0b232ee92f291cdcb546afd6370ff576536c872f75f113f779c2"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.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-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.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-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":"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":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":46,"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."]}]}